{"id":"https://openalex.org/W2519455498","doi":"https://doi.org/10.1145/2972953","title":"Smoothed Analysis of the 2-Opt Algorithm for the General TSP","display_name":"Smoothed Analysis of the 2-Opt Algorithm for the General TSP","publication_year":2016,"publication_date":"2016-09-14","ids":{"openalex":"https://openalex.org/W2519455498","doi":"https://doi.org/10.1145/2972953","mag":"2519455498"},"language":"en","primary_location":{"id":"doi:10.1145/2972953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2972953","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5007064425","display_name":"Matthias Englert","orcid":"https://orcid.org/0000-0002-8859-7731"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matthias Englert","raw_affiliation_strings":["University of Warwick, Coventry, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034122679","display_name":"Heiko R\u00f6glin","orcid":"https://orcid.org/0009-0006-8438-3986"},"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":"Heiko R\u00f6glin","raw_affiliation_strings":["University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066021048","display_name":"Berthold V\u00f6cking","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Berthold V\u00f6cking","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007064425"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.8868,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.84601299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/mathematics","display_name":"Mathematics","score":0.642148494720459},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5826350450515747},{"id":"https://openalex.org/keywords/probability-density-function","display_name":"Probability density function","score":0.5122727751731873},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.49829530715942383},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4939499497413635},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4648496210575104},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4614827036857605},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4480661153793335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44000065326690674},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.43495041131973267},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4236699342727661},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4224364757537842},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41611966490745544},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3480173349380493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34629493951797485},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1831810176372528}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.642148494720459},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5826350450515747},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.5122727751731873},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.49829530715942383},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4939499497413635},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4648496210575104},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4614827036857605},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4480661153793335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44000065326690674},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.43495041131973267},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4236699342727661},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4224364757537842},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41611966490745544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3480173349380493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34629493951797485},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1831810176372528},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2972953","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2972953","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:81525","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:publications.rwth-aachen.de:685908","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/685908","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM transactions on algorithms : TALG 13(1), 1-15 (2016). doi:10.1145/2972953","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G6743243744","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7326268580","display_name":null,"funder_award_id":"WE 2842/1","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":6,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1552810675","https://openalex.org/W1923505183","https://openalex.org/W2034053794","https://openalex.org/W2045173407","https://openalex.org/W2079868147"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4297427155","https://openalex.org/W3136451934","https://openalex.org/W3025823153","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269"],"abstract_inverted_index":{"2-Opt":[0,36,52],"is":[1,88,122,136],"a":[2,46,77,91,110],"simple":[3],"local":[4,47,55,134],"search":[5],"heuristic":[6],"for":[7,114],"the":[8,67,85,130,155,172],"traveling":[9],"salesperson":[10],"problem":[11],"that":[12,126],"performs":[13],"very":[14],"well":[15],"in":[16,58,66,83,127],"experiments":[17],"with":[18],"respect":[19],"to":[20,29,44,90,118],"both":[21],"running":[22,64],"time":[23,65],"and":[24,109,152,159,165],"solution":[25],"quality.":[26],"In":[27,97],"contrast":[28],"this,":[30],"there":[31],"are":[32],"instances":[33],"on":[34,171],"which":[35,72,84,119],"may":[37],"need":[38],"an":[39,102,105,168],"exponential":[40],"number":[41,132,156],"of":[42,69,80,94,133,157,161],"steps":[43],"reach":[45],"optimum.":[48],"To":[49],"understand":[50],"why":[51],"usually":[53],"finds":[54],"optima":[56],"quickly":[57],"experiments,":[59],"we":[60],"study":[61],"its":[62,120],"expected":[63,131],"model":[68,129],"smoothed":[70],"analysis,":[71],"can":[73],"be":[74],"considered":[75],"as":[76],"less-pessimistic":[78],"variant":[79],"worst-case":[81],"analysis":[82],"adversarial":[86],"input":[87,100],"subject":[89],"small":[92],"amount":[93],"random":[95],"noise.":[96],"our":[98],"probabilistic":[99],"model,":[101],"adversary":[103],"chooses":[104],"arbitrary":[106],"graph":[107],"G":[108,162],"probability":[111],"density":[112,173],"function":[113],"each":[115],"edge":[116],"according":[117],"length":[121],"chosen.":[123],"We":[124],"prove":[125],"this":[128],"improvements":[135],"O":[137],"(mn\u03d5":[138],"\u010b":[139],"16":[140],"\u221aln":[141],"m":[142,144,153],")=":[143],"1+":[145],"o":[146],"(1)":[147],"n\u03d5":[148],",":[149,163],"where":[150],"n":[151],"denote":[154],"vertices":[158],"edges":[160],"respectively,":[164],"\u03d5":[166],"denotes":[167],"upper":[169],"bound":[170],"functions.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}