{"id":"https://openalex.org/W2950127069","doi":"https://doi.org/10.1145/3326123","title":"The Salesman\u2019s Improved Paths through Forests","display_name":"The Salesman\u2019s Improved Paths through Forests","publication_year":2019,"publication_date":"2019-06-05","ids":{"openalex":"https://openalex.org/W2950127069","doi":"https://doi.org/10.1145/3326123","mag":"2950127069"},"language":"en","primary_location":{"id":"doi:10.1145/3326123","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3326123","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108139649","display_name":"Andr\u00e1s Seb\u0151","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Andr\u00e1s Seb\u0151","raw_affiliation_strings":["CNRS, Universit\u00e9 Grenoble Alpes, Grenoble, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 Grenoble Alpes, Grenoble, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I899635006"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078740101","display_name":"Anke van Zuylen","orcid":"https://orcid.org/0000-0002-8182-3134"},"institutions":[{"id":"https://openalex.org/I16285277","display_name":"William & Mary","ror":"https://ror.org/03hsf0573","country_code":"US","type":"education","lineage":["https://openalex.org/I16285277"]},{"id":"https://openalex.org/I267592682","display_name":"Williams (United States)","ror":"https://ror.org/007zhvp17","country_code":"US","type":"company","lineage":["https://openalex.org/I267592682"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anke Van Zuylen","raw_affiliation_strings":["College of William 8 Mary, Williamsburg VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of William 8 Mary, Williamsburg VA, USA","institution_ids":["https://openalex.org/I16285277","https://openalex.org/I267592682"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3102,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89442666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"66","issue":"4","first_page":"1","last_page":"16"},"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.9994000196456909,"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.9994000196456909,"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.9965999722480774,"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.996399998664856,"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.815644383430481},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6696199178695679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5792844295501709},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5107095241546631},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5091220736503601},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.468072772026062},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46031707525253296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45157283544540405},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.44538843631744385},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4374268651008606},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4267841875553131},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.42669740319252014},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3278498649597168},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3206278681755066},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.2332170307636261},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12090408802032471}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.815644383430481},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6696199178695679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5792844295501709},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5107095241546631},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5091220736503601},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.468072772026062},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46031707525253296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45157283544540405},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.44538843631744385},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4374268651008606},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4267841875553131},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.42669740319252014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3278498649597168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3206278681755066},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.2332170307636261},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12090408802032471},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3326123","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3326123","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:HAL:hal-03002862v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03002862","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM (JACM), 2019, 66 (4), pp.1 - 16. ⟨10.1145/3326123⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1918092171","display_name":null,"funder_award_id":"#359525","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"},{"id":"https://openalex.org/G6175499886","display_name":"Systemes et Algorithmes Pervasifs au confluent des mondes physique et num\u00e9rique","funder_award_id":"ANR-11-LABX-0025","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W656060844","https://openalex.org/W1546311336","https://openalex.org/W1714357736","https://openalex.org/W1971797008","https://openalex.org/W1999799345","https://openalex.org/W2012329067","https://openalex.org/W2058937865","https://openalex.org/W2063836932","https://openalex.org/W2064284095","https://openalex.org/W2087818742","https://openalex.org/W2090960684","https://openalex.org/W2137653883","https://openalex.org/W2162750432","https://openalex.org/W2240814884","https://openalex.org/W2278286793","https://openalex.org/W2399100674","https://openalex.org/W2566339654","https://openalex.org/W2605037349","https://openalex.org/W2765549233","https://openalex.org/W2802283659","https://openalex.org/W2963750353","https://openalex.org/W2964025294","https://openalex.org/W2964044445","https://openalex.org/W2988480584","https://openalex.org/W3101686738","https://openalex.org/W4242361212","https://openalex.org/W4301322391"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W562960941","https://openalex.org/W2051378252","https://openalex.org/W2055574289","https://openalex.org/W2950637524","https://openalex.org/W4301419164","https://openalex.org/W942307408","https://openalex.org/W2592478754"],"abstract_inverted_index":{"We":[0,98,172],"give":[1],"a":[2,23,47,109,140,152],"new,":[3],"strongly":[4],"polynomial-time":[5],"algorithm":[6,118,222],"and":[7,87,119,148,156,200,223,235],"improved":[8],"analysis":[9,120,224],"for":[10,50,108,143],"the":[11,31,34,51,59,65,70,81,85,88,101,114,126,130,145,149,169,184,188,197,209,230],"metric":[12],"s":[13],"-":[14],"t":[15],"path":[16],"Traveling":[17],"Salesman":[18],"Problem":[19],"(TSP).":[20],"It":[21],"finds":[22],"tour":[24],"of":[25,33,61,64,80,151,154,162,187,213],"cost":[26],"less":[27],"than":[28],"1.53":[29],"times":[30],"optimum":[32],"subtour":[35],"elimination":[36],"linear":[37],"program":[38],"(LP),":[39],"while":[40,233],"known":[41],"examples":[42],"show":[43,99,173],"that":[44,100,174,216],"1.5":[45],"is":[46,58,74],"lower":[48],"bound":[49],"integrality":[52,198],"gap.":[53],"A":[54],"key":[55],"new":[56,134,192],"idea":[57],"deletion":[60],"some":[62],"edges":[63],"spanning":[66,159,185],"trees":[67,186],"used":[68],"in":[69,208,218,229],"best-of-many":[71,127,189],"Christofides-Serdyukov-algorithm,":[72],"which":[73,163,177],"then":[75,92],"accompanied":[76],"by":[77,95,168],"novel":[78],"arguments":[79],"analysis:":[82],"edge-deletion":[83],"disconnects":[84],"trees,":[86,160,176],"arising":[89,102],"forests":[90],"are":[91,136,178],"partly":[93],"reconnected":[94],"\u201cparity":[96],"correction.\u201d":[97],"\u201cconnectivity":[103],"correction\u201d":[104],"can":[105,164,182],"be":[106,166],"achieved":[107],"minor":[110],"extra":[111],"cost.":[112],"On":[113,129],"one":[115],"hand,":[116,132],"this":[117,214],"extend":[121],"previous":[122],"tools":[123,135],"such":[124,138],"as":[125,139,205],"Christofides-Serdyukov-algorithm.":[128,190],"other":[131],"powerful":[133],"solicited,":[137],"flow":[141],"problem":[142],"analyzing":[144],"reconnection":[146],"cost,":[147],"construction":[150],"set":[153],"more":[155,157],"restrictive":[158],"each":[161],"still":[165],"found":[167],"greedy":[170],"algorithm.":[171],"these":[175],"easy":[179],"to":[180,195],"compute,":[181],"replace":[183],"These":[191],"methods":[193],"lead":[194],"improving":[196],"ratio":[199],"approximation":[201],"guarantee":[202],"below":[203],"1.53,":[204],"was":[206],"shown":[207],"preliminary,":[210],"shortened":[211],"version":[212],"article":[215],"appeared":[217],"FOCS":[219],"2016.":[220],"The":[221],"have":[225,237],"been":[226,238],"significantly":[227],"simplified":[228],"current":[231],"article,":[232],"details":[234],"explanations":[236],"added.":[239]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2019-06-27T00:00:00"}