{"id":"https://openalex.org/W3096239448","doi":"https://doi.org/10.1145/3424306","title":"A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem","display_name":"A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem","publication_year":2020,"publication_date":"2020-11-03","ids":{"openalex":"https://openalex.org/W3096239448","doi":"https://doi.org/10.1145/3424306","mag":"3096239448"},"language":"en","primary_location":{"id":"doi:10.1145/3424306","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3424306","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/174148","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076652577","display_name":"Jakub Tarnawski","orcid":"https://orcid.org/0000-0001-6175-5827"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jakub Tarnawski","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049428164","display_name":"L\u00e1szl\u00f3 A. V\u00e9gh","orcid":"https://orcid.org/0000-0003-1152-200X"},"institutions":[{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 A. V\u00e9gh","raw_affiliation_strings":["London School of Economics and Political Science, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"London School of Economics and Political Science, London, United Kingdom","institution_ids":["https://openalex.org/I909854389"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6667,"has_fulltext":true,"cited_by_count":44,"citation_normalized_percentile":{"value":0.94906558,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"67","issue":"6","first_page":"1","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.989300012588501,"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.8878517150878906},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.744586706161499},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.682207465171814},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6138626933097839},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6051044464111328},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5501717329025269},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5384542346000671},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5380368828773499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.482441246509552},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.46161067485809326},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4557986855506897},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42846155166625977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4068647623062134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4044922888278961},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3609849810600281},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.1830751597881317}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8878517150878906},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.744586706161499},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.682207465171814},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6138626933097839},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6051044464111328},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5501717329025269},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5384542346000671},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5380368828773499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.482441246509552},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.46161067485809326},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4557986855506897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42846155166625977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4068647623062134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4044922888278961},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3609849810600281},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.1830751597881317},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3424306","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3424306","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:researchonline.lse.ac.uk:106582","is_oa":false,"landing_page_url":"https://orcid.org/0000-0003-1152-200X>","pdf_url":null,"source":{"id":"https://openalex.org/S4306400050","display_name":"London School of Economics and Political Science Theses Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:infoscience.epfl.ch:282316","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/174148","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:282316","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/174148","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G1637932959","display_name":null,"funder_award_id":"EP/M02797X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G211972097","display_name":"New strongly polynomial algorithms for network optimisation problems","funder_award_id":"EP/M02797X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3052677248","display_name":null,"funder_award_id":"200021-184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G3811618785","display_name":null,"funder_award_id":"335288?OptApprox,757481?ScaleOpt","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G4915951725","display_name":"Randomness in Problem Instances and Randomized Algorithms","funder_award_id":"184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5256785375","display_name":null,"funder_award_id":"200021-","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320312710","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1576649545","https://openalex.org/W1585256533","https://openalex.org/W1893433258","https://openalex.org/W1977006915","https://openalex.org/W1999180449","https://openalex.org/W1999799345","https://openalex.org/W2028413050","https://openalex.org/W2035610952","https://openalex.org/W2038652993","https://openalex.org/W2056179869","https://openalex.org/W2061549332","https://openalex.org/W2083210138","https://openalex.org/W2123701486","https://openalex.org/W2140787410","https://openalex.org/W2167197687","https://openalex.org/W2240814884","https://openalex.org/W2278286793","https://openalex.org/W2324166574","https://openalex.org/W2569455461","https://openalex.org/W2951508903","https://openalex.org/W2951794910","https://openalex.org/W2988480584","https://openalex.org/W3035464720","https://openalex.org/W3099932027","https://openalex.org/W3121437753","https://openalex.org/W3136659659","https://openalex.org/W4300645277","https://openalex.org/W4301808069"],"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/W2044119054"],"abstract_inverted_index":{"We":[0,66],"give":[1],"a":[2,45,87,98],"constant-factor":[3,117],"approximation":[4,14,118],"algorithm":[5,71,81,119],"for":[6,72,82,120],"the":[7,21,30,58,92],"asymmetric":[8],"traveling":[9],"salesman":[10],"problem":[11,53],"(ATSP).":[12],"Our":[13],"guarantee":[15],"is":[16,44],"analyzed":[17],"with":[18],"respect":[19],"to":[20,47,104],"standard":[22],"LP":[23],"relaxation,":[24],"and":[25],"thus":[26],"our":[27,42,116],"result":[28],"confirms":[29],"conjectured":[31],"constant":[32,89],"integrality":[33],"gap":[34],"of":[35,41],"that":[36,69],"relaxation.":[37],"The":[38],"main":[39],"idea":[40],"approach":[43],"reduction":[46,99],"Subtour":[48,73,112],"Partition":[49,74,113],"Cover,":[50,114],"an":[51,80],"easier":[52],"obtained":[54],"by":[55],"significantly":[56],"relaxing":[57],"general":[59,101],"connectivity":[60,64],"requirements":[61],"into":[62,79],"local":[63],"conditions.":[65],"first":[67],"show":[68],"any":[70],"Cover":[75],"can":[76],"be":[77],"turned":[78],"ATSP":[83,102],"while":[84],"only":[85],"losing":[86],"small":[88],"factor":[90],"in":[91],"performance":[93],"guarantee.":[94],"Next,":[95],"we":[96,109],"present":[97],"from":[100],"instances":[103],"structured":[105],"instances,":[106],"on":[107],"which":[108],"then":[110],"solve":[111],"yielding":[115],"ATSP.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-10-10T00:00:00"}