{"id":"https://openalex.org/W2921785090","doi":"https://doi.org/10.1145/3309715","title":"Approaching 3/2 for the <i>s</i> - <i>t</i> -path TSP","display_name":"Approaching 3/2 for the <i>s</i> - <i>t</i> -path TSP","publication_year":2019,"publication_date":"2019-03-07","ids":{"openalex":"https://openalex.org/W2921785090","doi":"https://doi.org/10.1145/3309715","mag":"2921785090"},"language":"en","primary_location":{"id":"doi:10.1145/3309715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3309715","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/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":["Research Institute for Discrete Mathematics, University of Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","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":["Research Institute for Discrete Mathematics, University of Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":4.4346,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94890771,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"66","issue":"2","first_page":"1","last_page":"17"},"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.9574000239372253,"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.9574000239372253,"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.9476000070571899,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9384999871253967,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7819259166717529},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6892778277397156},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.638015866279602},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.578029990196228},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5111802220344543},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5000979900360107},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47958365082740784},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4741218388080597},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.42845314741134644},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4282875657081604},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4195931553840637},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.411684513092041},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35219115018844604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2366860806941986},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1928289532661438}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7819259166717529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6892778277397156},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.638015866279602},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.578029990196228},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5111802220344543},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5000979900360107},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47958365082740784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4741218388080597},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.42845314741134644},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4282875657081604},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4195931553840637},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.411684513092041},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35219115018844604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2366860806941986},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1928289532661438},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3309715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3309715","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1546311336","https://openalex.org/W1714357736","https://openalex.org/W1986334784","https://openalex.org/W2009803313","https://openalex.org/W2020163691","https://openalex.org/W2027868217","https://openalex.org/W2064284095","https://openalex.org/W2137653883","https://openalex.org/W2162750432","https://openalex.org/W2240814884","https://openalex.org/W2765549233","https://openalex.org/W2964025294","https://openalex.org/W2964044445","https://openalex.org/W3101686738"],"related_works":["https://openalex.org/W2065436195","https://openalex.org/W2154792656","https://openalex.org/W2055782437","https://openalex.org/W2107689258","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W3149578574","https://openalex.org/W2059496069","https://openalex.org/W4387578030","https://openalex.org/W2378280103"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,28,154],"there":[3],"is":[4,26,162,170],"a":[5,59,70,74,119,131,140],"polynomial-time":[6],"algorithm":[7,33,97],"with":[8,43],"approximation":[9],"guarantee":[10],"3/2+\u03b5":[11],"for":[12,19,36,49,125],"the":[13,37,50,55,79,82,92,109,116,164,171,180],"s":[14,38],"-":[15,39],"t":[16,40],"-path":[17,41],"TSP,":[18],"any":[20],"fixed":[21,65],"\u03b5":[22],"&gt;":[23],"0.":[24],"It":[25],"well-known":[27],"Wolsey\u2019s":[29],"analysis":[30],"of":[31,121,173],"Christofide":[32],"also":[34],"works":[35],"TSP":[42],"its":[44],"natural":[45],"LP":[46,56,150],"relaxation,":[47],"except":[48],"narrow":[51,75],"cuts":[52,103],"(in":[53],"which":[54],"solution":[57,151],"has":[58,68,179],"value":[60,120],"less":[61],"than":[62],"two).":[63],"A":[64],"optimum":[66],"tour":[67],"either":[69],"single":[71],"edge":[72,80],"in":[73,163,177],"cut":[76,83,93],"(then":[77,90],"call":[78,91],"and":[81,104,114,148],"lonely":[84,102],")":[85,147],"or":[86],"at":[87,122],"least":[88,123],"three":[89,124],"busy":[94,126],").":[95],"Our":[96],"\u201cguesses\u201d":[98],"(by":[99],"dynamic":[100,135],"programming)":[101],"edges.":[105],"Then,":[106],"we":[107,137],"partition":[108],"instance":[110],"into":[111],"smaller":[112],"instances":[113],"strengthen":[115],"LP,":[117],"requiring":[118],"cuts.":[127],"By":[128],"setting":[129],"up":[130],"k":[132,159],"-stage":[133],"recursive":[134],"program,":[136],"can":[138],"compute":[139],"spanning":[141],"tree":[142],"(":[143],"V":[144],",":[145],"S":[146,178],"an":[149],"y":[152,161],"such":[153],"(\u00bd+":[155],"O":[156],"(2":[157],"\u2212":[158],"))":[160],"T":[165,169],"-join":[166],"polyhedron,":[167],"where":[168],"set":[172],"vertices":[174],"whose":[175],"degree":[176],"wrong":[181],"parity.":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}