{"id":"https://openalex.org/W2980171939","doi":"https://doi.org/10.1145/3341730","title":"Improving TSP Tours Using Dynamic Programming over Tree Decompositions","display_name":"Improving TSP Tours Using Dynamic Programming over Tree Decompositions","publication_year":2019,"publication_date":"2019-10-04","ids":{"openalex":"https://openalex.org/W2980171939","doi":"https://doi.org/10.1145/3341730","mag":"2980171939"},"language":"en","primary_location":{"id":"doi:10.1145/3341730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3341730","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/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084157220","display_name":"\u0141ukasz Kowalik","orcid":"https://orcid.org/0000-0002-7546-2969"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Kowalik","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073398305","display_name":"Arkadiusz Soca\u0142a","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Arkadiusz Soca\u0142a","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Banacha, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037989463"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77172925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"15","issue":"4","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"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.9973000288009644,"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.9940000176429749,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9776999950408936,"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.7668769359588623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.748100996017456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5989833474159241},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5189454555511475},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.503915011882782},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4971525967121124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49461981654167175},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.46282392740249634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41991159319877625},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4160251319408417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33640897274017334}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7668769359588623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.748100996017456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5989833474159241},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5189454555511475},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.503915011882782},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4971525967121124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49461981654167175},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.46282392740249634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41991159319877625},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4160251319408417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33640897274017334},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3341730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3341730","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2393148623","display_name":null,"funder_award_id":"2013/09/B/ST6/03136","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G2903952199","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1813769739","https://openalex.org/W1923505183","https://openalex.org/W1923819040","https://openalex.org/W1969186119","https://openalex.org/W1969259020","https://openalex.org/W1999799345","https://openalex.org/W2001868457","https://openalex.org/W2017708378","https://openalex.org/W2029242918","https://openalex.org/W2031178115","https://openalex.org/W2042986967","https://openalex.org/W2072008504","https://openalex.org/W2079868147","https://openalex.org/W2103981148","https://openalex.org/W2106378689","https://openalex.org/W2113885662","https://openalex.org/W2117226423","https://openalex.org/W2148673189","https://openalex.org/W2154399201","https://openalex.org/W2165142526","https://openalex.org/W2170702810","https://openalex.org/W2561675875","https://openalex.org/W2892948282","https://openalex.org/W2914414140","https://openalex.org/W3139453558","https://openalex.org/W4210733105"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W3100139999","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2900627138"],"abstract_inverted_index":{"Given":[0],"a":[1,12,32,47,62,80,161,199],"traveling":[2],"salesman":[3],"problem":[4],"(TSP)":[5],"tour":[6,34,55,82],"H":[7,23,35,56],"in":[8,87,118,166],"graph":[9],"G":[10,29],",":[11],"k":[13,20,26,41,65,77,92,108,123,125,130,134,147,156,179],"-move":[14,78],"is":[15,37],"an":[16,53,75,103,114,216],"operation":[17],"that":[18,31,116,176],"removes":[19],"edges":[21,27],"from":[22,52],"and":[24,57,100],"adds":[25],"of":[28,64,142,192],"so":[30],"new":[33],"\u2032":[36],"formed.":[38],"The":[39],"popular":[40],"-OPT":[42],"heuristic":[43],"for":[44,79,145,177,209,223,234],"TSP":[45],"finds":[46],"local":[48],"optimum":[49],"by":[50,61],"starting":[51],"arbitrary":[54],"then":[58],"improving":[59,76,183],"it":[60],"sequence":[63],"-moves.":[66],"Until":[67],"2016,":[68],"the":[69,84,140,143,151,178,185,224],"only":[70],"known":[71],"algorithm":[72,115,164,191,208,222],"to":[73],"find":[74],"given":[81],"was":[83],"naive":[85],"solution":[86],"time":[88],"O":[89,104,119,167,186,203,217],"(":[90,105,120,168,187,204,218],"n":[91,106,121,169,188,205,219],").":[93],"At":[94],"ICALP\u201916,":[95],"de":[96,193],"Berg,":[97],"Buchin,":[98],"Jansen,":[99],"Woeginger":[101],"showed":[102],"\u230a2":[107],"/3\u230b+1":[109],")-time":[110,190,207,221],"algorithm.":[111],"We":[112,173],"show":[113,175],"runs":[117],"(1/4+\u03f5":[122],")":[124,126,171],"time,":[127],"where":[128],"lim":[129],"\u2192":[131],"\u221e":[132],"\u03f5":[133,211],"=":[135,157,180],"0.":[136,238],"It":[137],"improves":[138],"over":[139,184],"state":[141],"art":[144],"every":[146],"\u2265":[148],"5.":[149],"For":[150],"most":[152],"practically":[153],"relevant":[154],"case":[155],"5,":[158],"we":[159],"provide":[160],"slightly":[162],"refined":[163],"running":[165],"3.4":[170],"time.":[172],"also":[174],"4":[181],"case,":[182],"3":[189],"Berg":[194],"et":[195],"al.":[196],"would":[197,214],"be":[198],"major":[200],"breakthrough:":[201],"An":[202],"3\u2212\u03f5":[206],"any":[210],">":[212,237],"0":[213],"imply":[215],"3\u2212\u03b4":[220],"A":[225],"ll":[226],"P":[227,231],"airs":[228],"S":[229],"hortest":[230],"aths":[232],"problem,":[233],"some":[235],"\u03b4":[236]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}