{"id":"https://openalex.org/W4213165341","doi":"https://doi.org/10.1137/20m1339313","title":"An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem","display_name":"An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem","publication_year":2022,"publication_date":"2022-02-01","ids":{"openalex":"https://openalex.org/W4213165341","doi":"https://doi.org/10.1137/20m1339313"},"language":"en","primary_location":{"id":"doi:10.1137/20m1339313","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1339313","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065421870","display_name":"Vera Traub","orcid":"https://orcid.org/0000-0001-9749-2600"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vera Traub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6032,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83369891,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"51","issue":"1","first_page":"139","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.874518096446991},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7463351488113403},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.6504743695259094},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6437377333641052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5923603773117065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.576438844203949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4886201024055481},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4185096025466919},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4105684161186218},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.3806035816669464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3048003911972046},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05260813236236572}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.874518096446991},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7463351488113403},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.6504743695259094},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6437377333641052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5923603773117065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.576438844203949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4886201024055481},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4185096025466919},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4105684161186218},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.3806035816669464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3048003911972046},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05260813236236572},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1339313","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1339313","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5}],"awards":[{"id":"https://openalex.org/G83575632","display_name":null,"funder_award_id":"200021_184622","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1983002996","https://openalex.org/W1999799345","https://openalex.org/W2035610952","https://openalex.org/W2123701486","https://openalex.org/W2137653883","https://openalex.org/W2162750432","https://openalex.org/W2167197687","https://openalex.org/W2240814884","https://openalex.org/W2278286793","https://openalex.org/W2620774153","https://openalex.org/W2765549233","https://openalex.org/W2800453060","https://openalex.org/W2921785090","https://openalex.org/W2950127069","https://openalex.org/W2951508903","https://openalex.org/W2962875727","https://openalex.org/W3096239448","https://openalex.org/W3136659659"],"related_works":["https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W4389782626","https://openalex.org/W2766731260","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W1645834615","https://openalex.org/W87675801","https://openalex.org/W2171568915","https://openalex.org/W2055574289"],"abstract_inverted_index":{"We":[0,22,30,49],"revisit":[1],"the":[2,7,32,71,86,90],"constant-factor":[3],"approximation":[4,66,72],"algorithm":[5,58],"for":[6,59,78],"asymmetric":[8],"traveling":[9],"salesman":[10],"problem":[11],"by":[12],"Svensson,":[13],"Tarnawski,":[14],"and":[15,37,42],"V\u00e9gh":[16],"[J.":[17],"ACM,":[18],"67":[19],"(2020),":[20],"37].":[21],"improve":[23,70],"on":[24,89],"each":[25],"part":[26],"of":[27,56],"this":[28],"algorithm.":[29],"avoid":[31],"reduction":[33,45],"to":[34,46,76,95],"irreducible":[35],"instances":[36],"thus":[38],"obtain":[39],"a":[40,53,63],"simpler":[41],"much":[43,64],"better":[44],"vertebrate":[47,60],"pairs.":[48],"also":[50,84],"show":[51],"that":[52],"slight":[54],"variant":[55],"their":[57],"pairs":[61],"has":[62],"smaller":[65],"ratio.":[67],"Overall":[68],"we":[69],"ratio":[73,92],"from":[74,93],"506":[75],"$22+\\epsilon$":[77],"any":[79],"$\\epsilon":[80],">":[81],"0$.":[82],"This":[83],"improves":[85],"upper":[87],"bound":[88],"integrality":[91],"319":[94],"22.":[96]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}