{"id":"https://openalex.org/W2240814884","doi":"https://doi.org/10.1145/2818310","title":"Improving Christofides' Algorithm for the s-t Path TSP","display_name":"Improving Christofides' Algorithm for the s-t Path TSP","publication_year":2015,"publication_date":"2015-11-02","ids":{"openalex":"https://openalex.org/W2240814884","doi":"https://doi.org/10.1145/2818310","mag":"2240814884"},"language":"en","primary_location":{"id":"doi:10.1145/2818310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818310","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":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/213963","any_repository_has_fulltext":true},"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/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Hyung-Chan An","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","institution_ids":["https://openalex.org/I5124864"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059740882"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":5.8141,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.96617675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"62","issue":"5","first_page":"1","last_page":"28"},"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.9991999864578247,"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.9991999864578247,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.7292267084121704},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6836288571357727},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6553532481193542},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6226905584335327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6110803484916687},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5893551707267761},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.576090931892395},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5725843906402588},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5644839406013489},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5131741166114807},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4482663571834564},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4394156336784363},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43222206830978394},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.43017542362213135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42027100920677185},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.41526514291763306},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4132884442806244},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41090816259384155},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3298039138317108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2834421396255493},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24690505862236023},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2442323863506317},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.19077923893928528}],"concepts":[{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.7292267084121704},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6836288571357727},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6553532481193542},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6226905584335327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6110803484916687},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5893551707267761},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.576090931892395},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5725843906402588},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5644839406013489},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5131741166114807},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4482663571834564},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4394156336784363},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43222206830978394},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.43017542362213135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42027100920677185},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.41526514291763306},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4132884442806244},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41090816259384155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3298039138317108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2834421396255493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24690505862236023},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2442323863506317},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.19077923893928528},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/2818310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2818310","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:infoscience.epfl.ch:213963","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/213963","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:213963","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/213963","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7345597625","display_name":null,"funder_award_id":"FA9550-09-1-0100","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"},{"id":"https://openalex.org/F4320324571","display_name":"Korea Foundation for Advanced Studies","ror":"https://ror.org/0556dev32"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1546311336","https://openalex.org/W1569752386","https://openalex.org/W1714357736","https://openalex.org/W1986056047","https://openalex.org/W1991528957","https://openalex.org/W1999799345","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/W2042274567","https://openalex.org/W2043916130","https://openalex.org/W2044119054","https://openalex.org/W2044587929","https://openalex.org/W2051585135","https://openalex.org/W2058937865","https://openalex.org/W2063836932","https://openalex.org/W2064284095","https://openalex.org/W2077326088","https://openalex.org/W2080656989","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/W2399100674","https://openalex.org/W2497909753","https://openalex.org/W2767048380","https://openalex.org/W2950683345","https://openalex.org/W3101686738","https://openalex.org/W3121437753","https://openalex.org/W3203962094"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W2951475756","https://openalex.org/W4220861011","https://openalex.org/W2071845176","https://openalex.org/W1991421283","https://openalex.org/W3016811403","https://openalex.org/W2051585135","https://openalex.org/W2953018219"],"abstract_inverted_index":{"We":[0,74],"present":[1],"a":[2,18,34,52,97],"deterministic":[3],"(1+\u221a5/2)-approximation":[4],"algorithm":[5,50,54,77,123,126],"for":[6,13,55,171],"the":[7,29,39,45,67,82,92,115,120,135,139,172,180],"s":[8,174,184],"-":[9,175,185],"t":[10,176,186],"path":[11,37,177,187],"TSP":[12],"an":[14,88,110,129],"arbitrary":[15],"metric.":[16],"Given":[17],"symmetric":[19],"metric":[20,183],"cost":[21],"on":[22,87,134],"n":[23],"vertices":[24],"including":[25],"two":[26,40],"prespecified":[27],"endpoints,":[28],"problem":[30,178],"is":[31,51],"to":[32,91,109,152],"find":[33],"shortest":[35],"Hamiltonian":[36],"between":[38],"endpoints;":[41],"Hoogeveen":[42],"showed":[43],"that":[44,79],"natural":[46,121],"variant":[47],"of":[48,132,138],"Christofides'":[49,122],"5/3-approximation":[53],"this":[56,59,76,103,147],"problem,":[57],"and":[58,164,179],"asymptotically":[60],"tight":[61],"bound":[62,131],"in":[63,146],"fact":[64],"has":[65],"been":[66],"best":[68],"approximation":[69,112,162],"ratio":[70,117],"known":[71],"until":[72],"now.":[73],"modify":[75],"so":[78],"it":[80],"chooses":[81],"initial":[83],"spanning":[84,99],"tree":[85],"based":[86],"optimal":[89],"solution":[90],"Held-Karp":[93,141],"relaxation":[94],"rather":[95],"than":[96],"minimum":[98],"tree;":[100],"we":[101],"prove":[102],"simple":[104],"but":[105],"crucial":[106],"modification":[107],"leads":[108],"improved":[111,161,165],"ratio,":[113],"surpassing":[114],"20-year-old":[116],"set":[118],"by":[119],"variant.":[124],"Our":[125],"also":[127],"proves":[128],"upper":[130,169],"1+\u221a5/2":[133],"integrality":[136,167],"gap":[137,168],"path-variant":[140],"relaxation.":[142],"The":[143],"techniques":[144],"devised":[145],"article":[148],"can":[149],"be":[150],"applied":[151],"other":[153],"optimization":[154],"problems":[155],"as":[156],"well:":[157],"these":[158],"applications":[159],"include":[160],"algorithms":[163],"LP":[166],"bounds":[170],"prize-collecting":[173],"unit-weight":[181],"graphical":[182],"TSP.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":4}],"updated_date":"2026-05-30T09:04:40.226872","created_date":"2025-10-10T00:00:00"}