{"id":"https://openalex.org/W4384931296","doi":"https://doi.org/10.1137/21m146199x","title":"The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem","display_name":"The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem","publication_year":2023,"publication_date":"2023-07-20","ids":{"openalex":"https://openalex.org/W4384931296","doi":"https://doi.org/10.1137/21m146199x"},"language":"en","primary_location":{"id":"doi:10.1137/21m146199x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m146199x","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":["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/A5053836353","display_name":"Ulrich A. Brodowsky","orcid":null},"institutions":[{"id":"https://openalex.org/I99977706","display_name":"FH Aachen","ror":"https://ror.org/04tqgg260","country_code":"DE","type":"education","lineage":["https://openalex.org/I99977706"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ulrich A. Brodowsky","raw_affiliation_strings":["52076 Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"52076 Aachen, Germany","institution_ids":["https://openalex.org/I99977706"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085228445","display_name":"Stefan Hougardy","orcid":"https://orcid.org/0000-0001-8656-3418"},"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"]},{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Stefan Hougardy","raw_affiliation_strings":["Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, 53113 Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8656-3418","affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, 53113 Bonn, Germany","institution_ids":["https://openalex.org/I135140700","https://openalex.org/I2799411422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052497526","display_name":"Xianghui Zhong","orcid":"https://orcid.org/0000-0003-3812-2903"},"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"]},{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Xianghui Zhong","raw_affiliation_strings":["Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, 53113 Bonn, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3812-2903","affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn, 53113 Bonn, Germany","institution_ids":["https://openalex.org/I135140700","https://openalex.org/I2799411422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053836353"],"corresponding_institution_ids":["https://openalex.org/I99977706"],"apc_list":null,"apc_paid":null,"fwci":1.9753,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87527575,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"52","issue":"4","first_page":"841","last_page":"864"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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.9857000112533569,"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.9140641689300537},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6735864281654358},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6350763440132141},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6191969513893127},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5895705223083496},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5749695897102356},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.5473653078079224},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5450783371925354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.542908251285553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5215887427330017},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5010836124420166},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4615933895111084},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4468994438648224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3472850024700165},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07052454352378845}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9140641689300537},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6735864281654358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6350763440132141},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6191969513893127},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5895705223083496},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5749695897102356},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5473653078079224},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5450783371925354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.542908251285553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5215887427330017},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5010836124420166},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4615933895111084},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4468994438648224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3472850024700165},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07052454352378845}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m146199x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m146199x","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6200000047683716}],"awards":[{"id":"https://openalex.org/G8045704758","display_name":null,"funder_award_id":"EXC-2047/1 \u2013 390685813","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1552810675","https://openalex.org/W1717440967","https://openalex.org/W1994248285","https://openalex.org/W1994863634","https://openalex.org/W2004153594","https://openalex.org/W2011039300","https://openalex.org/W2055569927","https://openalex.org/W2079868147","https://openalex.org/W2086917808","https://openalex.org/W2102076751","https://openalex.org/W2117226423","https://openalex.org/W2159579504","https://openalex.org/W2165142526","https://openalex.org/W3025823153","https://openalex.org/W3169821571"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W2171568915","https://openalex.org/W4220987199","https://openalex.org/W4376138746","https://openalex.org/W1966089951","https://openalex.org/W2191054341","https://openalex.org/W1645834615","https://openalex.org/W1992470106"],"abstract_inverted_index":{".The":[0],"\\(k\\)":[1,24,30,60,135],"-Opt":[2,61,136],"heuristic":[3,8,62],"is":[4,63],"a":[5,38,99],"simple":[6],"improvement":[7],"for":[9,45,95,103,114],"the":[10,27,46,55,59,73,96,104,115],"traveling":[11,49],"salesman":[12,50,131],"problem.":[13],"It":[14],"starts":[15],"with":[16,52,124],"an":[17],"arbitrary":[18,121],"tour":[19,28],"and":[20,83,93],"then":[21],"repeatedly":[22],"replaces":[23],"edges":[25],"of":[26,58,76],"by":[29,80],"other":[31],"edges,":[32],"as":[33,35],"long":[34],"this":[36],"yields":[37],"shorter":[39],"tour.":[40],"We":[41],"will":[42],"prove":[43],"that":[44],"2-dimensional":[47],"Euclidean":[48,116],"problem":[51],"\\(n\\)":[53],"cities":[54],"approximation":[56],"ratio":[57],"\\(\\Theta":[64],"(\\log":[65],"n/":[66],"\\log":[67,68],"n)\\)":[69,78],".":[70,108],"This":[71],"improves":[72],"upper":[74],"bound":[75,102],"\\(O(\\log":[77],"given":[79],"Chandra,":[81],"Karloff,":[82],"Tovey":[84],"in":[85],"[SIAM":[86],"J.":[87],"Comput.,":[88],"28":[89],"(1999),":[90],"pp.":[91],"1998\u20132029]":[92],"provides":[94],"first":[97],"time":[98],"nontrivial":[100],"lower":[101],"case":[105],"\\(k\\ge":[106],"3\\)":[107],"Our":[109],"results":[110],"not":[111],"only":[112],"hold":[113],"norm":[117],"but":[118],"extend":[119],"to":[120],"\\(p\\)":[122],"-norms":[123],"\\(1":[125],"\\le":[126],"p":[127],"\\lt":[128],"\\infty\\)":[129],".Keywordstraveling":[130],"problemEuclidean":[132],"TSPapproximation":[133],"algorithm":[134],"heuristicMSC":[137],"codes90C2768W2568W40":[138]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}