{"id":"https://openalex.org/W2278286793","doi":"https://doi.org/10.1145/2739008","title":"Removing and Adding Edges for the Traveling Salesman Problem","display_name":"Removing and Adding Edges for the Traveling Salesman Problem","publication_year":2016,"publication_date":"2016-02-12","ids":{"openalex":"https://openalex.org/W2278286793","doi":"https://doi.org/10.1145/2739008","mag":"2278286793"},"language":"en","primary_location":{"id":"doi:10.1145/2739008","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739008","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/219448","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041355842","display_name":"Tobias M\u00f6mke","orcid":"https://orcid.org/0000-0002-2509-6972"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias M\u00f6mke","raw_affiliation_strings":["Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"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":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0237,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96985447,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"63","issue":"1","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.995199978351593,"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.9945999979972839,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8363078236579895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7258103489875793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6255645155906677},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.6204929351806641},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5454405546188354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48738914728164673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46513786911964417},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4265159070491791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24966907501220703},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.18973392248153687},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.12361425161361694},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.07246527075767517}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8363078236579895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7258103489875793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6255645155906677},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.6204929351806641},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5454405546188354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48738914728164673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46513786911964417},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4265159070491791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24966907501220703},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.18973392248153687},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.12361425161361694},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.07246527075767517},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2739008","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739008","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:219448","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/219448","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"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:83539","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/83539","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:219448","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/219448","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":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G409001275","display_name":null,"funder_award_id":"BL511/10-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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1496303805","https://openalex.org/W1547496874","https://openalex.org/W1582969422","https://openalex.org/W1714357736","https://openalex.org/W1715329722","https://openalex.org/W1993298089","https://openalex.org/W1994248285","https://openalex.org/W1999799345","https://openalex.org/W2009803313","https://openalex.org/W2011449951","https://openalex.org/W2020163691","https://openalex.org/W2021659530","https://openalex.org/W2027868217","https://openalex.org/W2032495288","https://openalex.org/W2038652993","https://openalex.org/W2038858023","https://openalex.org/W2051585135","https://openalex.org/W2058937865","https://openalex.org/W2062254875","https://openalex.org/W2063836932","https://openalex.org/W2083210138","https://openalex.org/W2103216985","https://openalex.org/W2117226423","https://openalex.org/W2136400551","https://openalex.org/W2142607374","https://openalex.org/W2162750432","https://openalex.org/W2165142526","https://openalex.org/W2172689705","https://openalex.org/W2327315803","https://openalex.org/W2340149117","https://openalex.org/W2399100674","https://openalex.org/W2497909753","https://openalex.org/W3121437753","https://openalex.org/W4292027170","https://openalex.org/W4389615669","https://openalex.org/W6655913904"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2184834902","https://openalex.org/W2183097989","https://openalex.org/W2185409389","https://openalex.org/W2241463327","https://openalex.org/W2038458261","https://openalex.org/W2105006450","https://openalex.org/W1579502333","https://openalex.org/W2044119054"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,11,26,43,59,82,114],"framework":[3,108],"for":[4,35,111,122],"approximating":[5],"the":[6,36,47,56,65,77,95,99,103,123,135],"metric":[7],"TSP":[8,48],"based":[9],"on":[10,49,131],"novel":[12],"use":[13],"of":[14,38,84,98],"matchings.":[15],"Traditionally,":[16],"matchings":[17],"have":[18],"been":[19],"used":[20],"to":[21,24,42,64,73,76,81,119],"add":[22],"edges":[23,40],"make":[25],"given":[27],"graph":[28],"Eulerian,":[29],"whereas":[30],"our":[31],"approach":[32,57],"also":[33,109],"allows":[34,110],"removal":[37],"certain":[39],"leading":[41],"decreased":[44],"cost.":[45],"For":[46,69],"graphic":[50,132],"metrics":[51,133],"(graph-TSP),":[52],"we":[53,92],"show":[54,93],"that":[55,86,94],"gives":[58],"1.461-approximation":[60],"algorithm":[61],"with":[62],"respect":[63],"Held-Karp":[66,78,100],"lower":[67],"bound.":[68],"graph-TSP":[70],"restricted":[71],"either":[72],"half-integral":[74],"solutions":[75],"relaxation":[79,101],"or":[80],"class":[83],"graphs":[85],"contains":[87],"subcubic":[88],"and":[89,117,137],"claw-free":[90],"graphs,":[91],"integrality":[96],"gap":[97],"matches":[102],"conjectured":[104],"ratio":[105],"4/3.":[106],"The":[107],"generalizations":[112],"in":[113],"natural":[115],"way":[116],"leads":[118],"analogous":[120],"results":[121],"s":[124],",":[125],"t":[126],"-path":[127],"traveling":[128],"salesman":[129],"problem":[130],"where":[134],"start":[136],"end":[138],"vertices":[139],"are":[140],"prespecified.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
