{"id":"https://openalex.org/W2963049334","doi":"https://doi.org/10.1137/20m135594x","title":"Reducing Path TSP to TSP","display_name":"Reducing Path TSP to TSP","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W2963049334","doi":"https://doi.org/10.1137/20m135594x","mag":"2963049334"},"language":"en","primary_location":{"id":"doi:10.1137/20m135594x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m135594x","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1907.10376","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065421870","display_name":"Vera Traub","orcid":"https://orcid.org/0000-0001-9749-2600"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vera Traub","raw_affiliation_strings":["University of Bonn >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn >  >  >  >","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["University of Bonn >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn >  >  >  >","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Z\u00fcrich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00646022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"3","first_page":"14","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7595273852348328},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7307227849960327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.623765230178833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4871754050254822},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48075219988822937},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4666685163974762},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44881951808929443},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4395091235637665},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4251115322113037},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4139513671398163},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4123743772506714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37538713216781616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35970234870910645},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.28374648094177246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26242315769195557}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7595273852348328},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7307227849960327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.623765230178833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4871754050254822},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48075219988822937},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4666685163974762},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44881951808929443},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4395091235637665},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4251115322113037},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4139513671398163},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4123743772506714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37538713216781616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35970234870910645},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28374648094177246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26242315769195557},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":5,"locations":[{"id":"doi:10.1137/20m135594x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m135594x","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":"doi:10.1145/3357713.3384256","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1907.10376","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10376","pdf_url":"https://arxiv.org/pdf/1907.10376","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},{"id":"doi:10.48550/arxiv.1907.10376","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1907.10376","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2963049334","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.10376","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10376","pdf_url":"https://arxiv.org/pdf/1907.10376","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://openalex.org/G253236328","display_name":null,"funder_award_id":"817750","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G5072212969","display_name":null,"funder_award_id":"200021-165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"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"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W192675268","https://openalex.org/W1546311336","https://openalex.org/W1857333123","https://openalex.org/W1965608008","https://openalex.org/W1970824097","https://openalex.org/W1971797008","https://openalex.org/W1983002996","https://openalex.org/W1989224473","https://openalex.org/W1999799345","https://openalex.org/W2038652993","https://openalex.org/W2061549332","https://openalex.org/W2090960684","https://openalex.org/W2100440346","https://openalex.org/W2113939799","https://openalex.org/W2117226423","https://openalex.org/W2137653883","https://openalex.org/W2141355868","https://openalex.org/W2153014861","https://openalex.org/W2162750432","https://openalex.org/W2172955861","https://openalex.org/W2240814884","https://openalex.org/W2278286793","https://openalex.org/W2497909753","https://openalex.org/W2765549233","https://openalex.org/W2795536263","https://openalex.org/W2800453060","https://openalex.org/W2902837290","https://openalex.org/W2921785090","https://openalex.org/W2950127069","https://openalex.org/W2962875727","https://openalex.org/W2963750353","https://openalex.org/W2964025294","https://openalex.org/W2988480584","https://openalex.org/W3090361369","https://openalex.org/W3101686738","https://openalex.org/W3167350281","https://openalex.org/W4239790894","https://openalex.org/W4293179730","https://openalex.org/W4293860921","https://openalex.org/W6641533353","https://openalex.org/W6681044074","https://openalex.org/W6723679219","https://openalex.org/W6793303339"],"related_works":["https://openalex.org/W3035754533","https://openalex.org/W1855607842","https://openalex.org/W2502268637","https://openalex.org/W2187742086","https://openalex.org/W3041871524","https://openalex.org/W2970693157","https://openalex.org/W786133209","https://openalex.org/W3102803201","https://openalex.org/W2111091403","https://openalex.org/W1857333123","https://openalex.org/W2782913138","https://openalex.org/W1496303805","https://openalex.org/W2120983471","https://openalex.org/W2995938302","https://openalex.org/W2963750353","https://openalex.org/W779649698","https://openalex.org/W1970422603","https://openalex.org/W1632595703","https://openalex.org/W2072644029","https://openalex.org/W2005815569"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"black-box":[3],"reduction":[4,50],"from":[5],"the":[6,10,17,44,53,59,75],"path":[7],"version":[8,20],"of":[9,55],"Traveling":[11],"Salesman":[12],"Problem":[13],"(Path":[14],"TSP)":[15],"to":[16,65],"classical":[18],"tour":[19],"(TSP).":[21],"More":[22],"precisely,":[23],"we":[24],"show":[25],"that":[26,52],"given":[27],"an":[28,40,66],"\u03b1-approximation":[29],"algorithm":[30,42],"for":[31,34,43,62,81],"TSP,":[32,63],"then,":[33],"any":[35],"\u03b5":[36],">0,":[37],"there":[38],"is":[39,58],"(\u03b1+\u03b5)-approximation":[41],"more":[45],"general":[46],"Path":[47,56],"TSP.":[48],"This":[49,70],"implies":[51],"approximability":[54],"TSP":[57],"same":[60],"as":[61,85],"up":[64],"arbitrarily":[67],"small":[68],"error.":[69],"avoids":[71],"future":[72],"discrepancies":[73],"between":[74],"best":[76],"known":[77],"approximation":[78],"factors":[79],"achievable":[80],"these":[82],"two":[83],"problems,":[84],"they":[86],"have":[87],"existed":[88],"until":[89],"very":[90],"recently.":[91]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}