{"id":"https://openalex.org/W7216917469","doi":null,"title":"On the Approximability of TSP on Local Modifications of Optimally Solved Instances","display_name":"On the Approximability of TSP on Local Modifications of Optimally Solved Instances","alternate_titles":[],"publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W7216917469"},"language":"en","primary_location":{"id":"pmh:oai:ricerca.univaq.it:11697/4903","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11697/4903","pdf_url":null,"source":{"id":"https://openalex.org/S7407055225","display_name":"Archivio Istituzionale della Ricerca - Universit\u00e0 degli Studi dell Aquila","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"info:eu-repo/semantics/article"},"parent_works":[],"lineage":["https://openalex.org/W7216917469"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5086921684","display_name":"Hans-Joachim B\u00f6ckenhauer","orcid":"https://orcid.org/0000-0001-9164-3674","observed_orcids":["https://orcid.org/0000-0001-9164-3674"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. J. Bo\u0308ckenhauer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023691482","display_name":"Luca Forlizzi","orcid":"https://orcid.org/0000-0002-3923-7668","observed_orcids":["https://orcid.org/0000-0002-3923-7668"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"FORLIZZI, LUCA","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088678782","display_name":"Juraj Hromkovic\u0306","orcid":"https://orcid.org/0000-0001-9754-7042","observed_orcids":["https://orcid.org/0000-0001-9754-7042"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Hromkovic","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106182311","display_name":"Joachim Kneis","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Kneis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026895475","display_name":"Joachim Kupke","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Kupke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087770784","display_name":"Guido Proietti","orcid":"https://orcid.org/0000-0003-1009-5552","observed_orcids":["https://orcid.org/0000-0003-1009-5552"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"PROIETTI, GUIDO","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109904634","display_name":"Peter Widmayer","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Widmayer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3404,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.51902668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926999807357788,"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.9926999807357788,"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.0038999998942017555,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.000699999975040555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9909999966621399},{"id":"https://openalex.org/keywords/local-modification","display_name":"local modification","score":0.6119999885559082},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7070000171661377},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.4180000126361847},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.7229999899864197},{"id":"https://openalex.org/keywords/metric-tsp","display_name":"metric TSP","score":0.9200000166893005},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.7459999918937683},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7379999756813049},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.5239999890327454}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.604200005531311},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5619000196456909},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5253000259399414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4909000098705292},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.44339999556541443},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31709998846054077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3125},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25949999690055847}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:ricerca.univaq.it:11697/4903","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11697/4903","pdf_url":null,"source":{"id":"https://openalex.org/S7407055225","display_name":"Archivio Istituzionale della Ricerca - Universit\u00e0 degli Studi dell Aquila","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1501698934","https://openalex.org/W2170739645","https://openalex.org/W7024497500","https://openalex.org/W597992372","https://openalex.org/W1481223916","https://openalex.org/W1602543479","https://openalex.org/W936158724","https://openalex.org/W1505235268","https://openalex.org/W1970492377","https://openalex.org/W7099172081"],"abstract_inverted_index":{"Given":[0],"an":[1,7,57,61,153,201],"instance":[2,17,62,67],"of":[3,29,32,107],"TSP":[4],"together":[5],"with":[6],"optimal":[8,58],"solution,":[9],"we":[10,53,150,170,183,196],"consider":[11],"the":[12,27,30,46,65,135,160,176],"scenario":[13],"in":[14,26,51,101],"which":[15,64],"this":[16,81,96],"is":[18,77,109,119],"modified":[19,177],"locally,":[20],"where":[21,131],"a":[22,33,39,72,185],"local":[23,73],"modification":[24],"consists":[25],"alteration":[28],"weight":[31],"single":[34],"edge.":[35],"More":[36],"generally,":[37],"for":[38,90,124,126,141,145,175,180,189,192,207],"problem":[40,48,106],"$U$,":[41],"let":[42],"$\\textsc{lm-}U$":[43,91],"(local-modification-$U$)":[44],"denote":[45],"same":[47],"as~$U$,":[49],"but":[50],"$\\textsc{lm-}U$,":[52],"are":[54],"also":[55],"given":[56],"solution":[59],"to":[60,79,86,165,199],"from":[63],"input":[66,210],"can":[68],"be":[69,99],"derived":[70],"by":[71],"modification.":[74],"The":[75,104],"question":[76],"how":[78,85,198],"exploit":[80],"additional":[82,161],"knowledge,":[83],"\\ie":[84,115],"devise":[87],"better":[88,167,186],"algorithms":[89],"than":[92,168,191],"for~$U$.":[93],"Note":[94],"that":[95],"need":[97],"not":[98],"possible":[100],"all":[102,142,181],"cases:":[103],"general":[105],"\\tweakTSP":[108,125,130],"as":[110,112],"hard":[111],"\\TSP":[113],"itself,":[114],"unless":[116],"$P=NP$,":[117],"there":[118],"no":[120],"polynomial-time":[121],"$p(n)$-approximation":[122],"algorithm":[123,174],"any":[127],"polynomial~$p$.":[128],"Moreover,":[129],"inputs":[132],"must":[133],"satisfy":[134],"$\\beta$-triangle":[136],"inequality":[137],"(\\tweakTSPDB)":[138],"remains":[139],"NP-hard":[140],"$\\beta>\\frac{1}{2}$.":[143],"However,":[144],"\\tweakTSPD":[146],"(\\ie":[147],"metric":[148],"\\tweakTSP),":[149],"will":[151],"present":[152],"efficient":[154],"$1.4$-approx\\-i\\-ma\\-tion":[155],"algorithm.":[156],"In":[157],"other":[158],"words,":[159],"information":[162],"enables":[163],"us":[164],"do":[166],"if":[169],"simply":[171],"used":[172],"Christofides'":[173],"input.":[178],"Similarly,":[179],"$1<\\beta<3.34899$,":[182],"achieve":[184],"approximation":[187,202],"ratio":[188,203],"\\tweakTSPDB":[190],"\\TSPDB.":[193],"For":[194],"$\\frac{1}{2}\\leq\\beta<1$,":[195],"show":[197],"obtain":[200],"arbitrarily":[204],"close":[205],"to~$1$,":[206],"sufficiently":[208],"large":[209],"graphs.":[211]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7216917469","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-10-03T00:00:00"}
