{"id":"https://openalex.org/W2051585135","doi":"https://doi.org/10.1145/2213977.2214055","title":"Improving christofides' algorithm for the s-t path TSP","display_name":"Improving christofides' algorithm for the s-t path TSP","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2051585135","doi":"https://doi.org/10.1145/2213977.2214055","mag":"2051585135"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5059740882","display_name":"Hyung-Chan An","orcid":"https://orcid.org/0000-0002-3690-4621"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hyung-Chan An","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040052580","display_name":"Robert Kleinberg","orcid":"https://orcid.org/0000-0002-8306-3407"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Kleinberg","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030030349","display_name":"David B. Shmoys","orcid":"https://orcid.org/0000-0003-3882-901X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David B. Shmoys","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059740882"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":9.3295,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.98519844,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"886"},"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.9994999766349792,"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.9994999766349792,"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.9988999962806702,"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.9955999851226807,"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/christofides-algorithm","display_name":"Christofides algorithm","score":0.7453289031982422},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7269538640975952},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6713339686393738},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6271920204162598},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5852118134498596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5834358334541321},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.582572877407074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5822746157646179},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5573908090591431},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5140017867088318},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.44948798418045044},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.443970263004303},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4364902079105377},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.433575302362442},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4302642345428467},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4246172606945038},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41652312874794006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3212549388408661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28644245862960815},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.25983405113220215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23444226384162903},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.22277197241783142}],"concepts":[{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.7453289031982422},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7269538640975952},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6713339686393738},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6271920204162598},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5852118134498596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5834358334541321},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.582572877407074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5822746157646179},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5573908090591431},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5140017867088318},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.44948798418045044},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.443970263004303},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4364902079105377},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.433575302362442},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4302642345428467},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4246172606945038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41652312874794006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3212549388408661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28644245862960815},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25983405113220215},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23444226384162903},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.22277197241783142},{"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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2213977.2214055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.749.7128","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.749.7128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1110.4604.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1714357736","https://openalex.org/W1986056047","https://openalex.org/W1991528957","https://openalex.org/W2001139415","https://openalex.org/W2009803313","https://openalex.org/W2012329067","https://openalex.org/W2020163691","https://openalex.org/W2021659530","https://openalex.org/W2038652993","https://openalex.org/W2043916130","https://openalex.org/W2044119054","https://openalex.org/W2044587929","https://openalex.org/W2063836932","https://openalex.org/W2064284095","https://openalex.org/W2077326088","https://openalex.org/W2081444009","https://openalex.org/W2115556222","https://openalex.org/W2117226423","https://openalex.org/W2123087902","https://openalex.org/W2136400551","https://openalex.org/W2140071288","https://openalex.org/W2162344698","https://openalex.org/W2162750432","https://openalex.org/W2949399323","https://openalex.org/W2950382808","https://openalex.org/W2953018219","https://openalex.org/W3203962094"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4224251989","https://openalex.org/W1991421283","https://openalex.org/W4308416203","https://openalex.org/W4220861011","https://openalex.org/W2099915933","https://openalex.org/W2071845176","https://openalex.org/W3016811403","https://openalex.org/W2051585135","https://openalex.org/W2953018219"],"abstract_inverted_index":{"We":[0,72],"present":[1],"a":[2,16,32,50,95],"deterministic":[3],"(1+\u221a5/2)-approximation":[4],"algorithm":[5,48,52,75,121,124],"for":[6,11,53,169],"the":[7,27,37,43,65,80,90,113,118,133,137,170,176],"s-t":[8,172,180],"path":[9,35,173,181],"TSP":[10],"an":[12,86,108,127],"arbitrary":[13],"metric.":[14],"Given":[15],"symmetric":[17],"metric":[18,179],"cost":[19],"on":[20,85,132],"$n$":[21],"vertices":[22],"including":[23],"two":[24,38],"prespecified":[25],"endpoints,":[26],"problem":[28,174],"is":[29,49],"to":[30,89,107,150],"find":[31],"shortest":[33],"Hamiltonian":[34],"between":[36],"endpoints;":[39],"Hoogeveen":[40],"showed":[41],"that":[42,77],"natural":[44,119],"variant":[45],"of":[46,130,136],"Christofides'":[47,120],"5/3-approximation":[51],"this":[54,57,74,101,145],"problem,":[55],"and":[56,162,175],"asymptotically":[58],"tight":[59],"bound":[60,129],"in":[61,144],"fact":[62],"had":[63],"been":[64],"best":[66],"approximation":[67,110,160],"ratio":[68],"known":[69],"until":[70],"now.":[71],"modify":[73],"so":[76],"it":[78],"chooses":[79],"initial":[81],"spanning":[82,97],"tree":[83],"based":[84],"optimal":[87],"solution":[88],"Held-Karp":[91,139],"relaxation":[92],"rather":[93],"than":[94],"minimum":[96],"tree;":[98],"we":[99],"prove":[100],"simple":[102],"but":[103],"crucial":[104],"modification":[105],"leads":[106],"improved":[109,159,163],"ratio,":[111],"surpassing":[112],"20-year-old":[114],"barrier":[115],"set":[116],"by":[117],"variant.":[122],"Our":[123],"also":[125],"proves":[126],"upper":[128,167],"1+\u221a5/2":[131],"integrality":[134,165],"gap":[135,166],"path-variant":[138],"relaxation.":[140],"The":[141],"techniques":[142],"devised":[143],"paper":[146],"can":[147],"be":[148],"applied":[149],"other":[151],"optimization":[152],"problems":[153],"as":[154],"well:":[155],"these":[156],"applications":[157],"include":[158],"algorithms":[161],"LP":[164],"bounds":[168],"prize-collecting":[171],"unit-weight":[177],"graphical":[178],"TSP.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}