{"id":"https://openalex.org/W2515220202","doi":"https://doi.org/10.1137/130913328","title":"The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme","display_name":"The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2515220202","doi":"https://doi.org/10.1137/130913328","mag":"2515220202"},"language":"en","primary_location":{"id":"doi:10.1137/130913328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130913328","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1112.0699","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yair Bartal","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yair Bartal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Lee-Ad Gottlieb","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee-Ad Gottlieb","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Robert Krauthgamer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5388,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.90475768,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"45","issue":"4","first_page":"1563","last_page":"1581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2992999851703644,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2992999851703644,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.2337000072002411,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.08020000159740448,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.885699987411499},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6276000142097473},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6118999719619751},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5748000144958496},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5490000247955322},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5428000092506409},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5031999945640564},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.45669999718666077},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.45159998536109924}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.885699987411499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7348999977111816},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6276000142097473},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6118999719619751},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5748000144958496},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5428000092506409},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5031999945640564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45910000801086426},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.42089998722076416},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37290000915527344},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.3677999973297119},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3659999966621399},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.33570000529289246},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.265500009059906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2644999921321869},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26089999079704285}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/130913328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130913328","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"},{"id":"pmh:oai:arXiv.org:1112.0699","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1112.0699","pdf_url":"https://arxiv.org/pdf/1112.0699","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1112.0699","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1112.0699","pdf_url":"https://arxiv.org/pdf/1112.0699","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1594954118","https://openalex.org/W1983067644","https://openalex.org/W1994248285","https://openalex.org/W1995718774","https://openalex.org/W2007279610","https://openalex.org/W2017427469","https://openalex.org/W2055569927","https://openalex.org/W2059222268","https://openalex.org/W2083854723","https://openalex.org/W2105160468","https://openalex.org/W2141355868","https://openalex.org/W2165142526","https://openalex.org/W2399100674","https://openalex.org/W2583644876","https://openalex.org/W3138698442"],"related_works":[],"abstract_inverted_index":{"The":[0,49],"traveling":[1],"salesman":[2],"problem":[3,17,114],"(TSP)":[4],"is":[5],"among":[6],"the":[7,33,71,76,91,99,102,120,128],"most":[8],"famous":[9],"NP-hard":[10],"optimization":[11],"problems.":[12],"We":[13],"design":[14],"for":[15,21],"this":[16],"an":[18,41],"algorithm":[19,88,123],"that":[20,39,70,90,115],"any":[22],"fixed":[23],"$\\varepsilon>0$":[24],"computes":[25],"in":[26,36,75,81],"randomized":[27],"polynomial":[28],"time":[29,122],"a":[30,82,113],"$(1+\\varepsilon)$-approximation":[31],"to":[32],"optimal":[34],"tour":[35],"TSP":[37,80,96],"instances":[38],"form":[40],"arbitrary":[42],"metric":[43,95],"space":[44,103],"with":[45],"bounded":[46],"intrinsic":[47],"dimension.":[48],"celebrated":[50],"results":[51],"of":[52,79,94,101,124,127,135],"Arora":[53],"[J.":[54],"ACM,":[55],"45":[56],"(1998),":[57],"pp.":[58,67,138],"753--782]":[59],"and":[60,104],"Mitchell":[61],"[SIAM":[62],"J.":[63],"Comput.,":[64],"28":[65],"(1999),":[66],"1298--1309]":[68],"prove":[69],"above":[72],"result":[73,111],"holds":[74],"special":[77],"case":[78],"fixed-dimensional":[83],"Euclidean":[84],"space.":[85],"Thus,":[86],"our":[87],"demonstrates":[89],"algorithmic":[92],"tractability":[93],"depends":[97],"on":[98,106,133],"dimensionality":[100],"not":[105],"its":[107],"specific":[108],"geometry.":[109],"This":[110],"resolves":[112],"has":[116],"been":[117],"open":[118],"since":[119],"quasi-polynomial":[121],"Talwar":[125],"[Proceedings":[126],"36th":[129],"Annual":[130],"ACM":[131],"Symposium":[132],"Theory":[134],"Computing,":[136],"2004,":[137],"281--290].":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2016-09-16T00:00:00"}