{"id":"https://openalex.org/W2012438638","doi":"https://doi.org/10.1145/2151171.2151181","title":"The traveling salesman problem in bounded degree graphs","display_name":"The traveling salesman problem in bounded degree graphs","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W2012438638","doi":"https://doi.org/10.1145/2151171.2151181","mag":"2012438638"},"language":"en","primary_location":{"id":"doi:10.1145/2151171.2151181","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2151171.2151181","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/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Lund University, Sweden","Lund Univ., Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ., Sweden#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041727204","display_name":"Thore Husfeldt","orcid":"https://orcid.org/0000-0001-9078-4512"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]},{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Thore Husfeldt","raw_affiliation_strings":["IT University of Copenhagen, Denmark and Lund University, Sweden","IT University of Copenhagen, Denmark, and Lund University Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark and Lund University, Sweden","institution_ids":["https://openalex.org/I187531555","https://openalex.org/I83467386"]},{"raw_affiliation_string":"IT University of Copenhagen, Denmark, and Lund University Sweden#TAB#","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]},{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Helsinki Institute for Information Technology and University of Helsinki, Finland","Helsinki Institute for Information Technology and University of Helsinki, Finland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology and University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052","https://openalex.org/I32943570"]},{"raw_affiliation_string":"Helsinki Institute for Information Technology and University of Helsinki, Finland#TAB#","institution_ids":["https://openalex.org/I32943570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088812539","display_name":"Mikko Koivisto","orcid":"https://orcid.org/0000-0001-9662-3605"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]},{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Mikko Koivisto","raw_affiliation_strings":["Helsinki Institute for Information Technology and University of Helsinki, Finland","Helsinki Institute for Information Technology and University of Helsinki, Finland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology and University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052","https://openalex.org/I32943570"]},{"raw_affiliation_string":"Helsinki Institute for Information Technology and University of Helsinki, Finland#TAB#","institution_ids":["https://openalex.org/I32943570"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8246,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.96524121,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"2","first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/bounded-function","display_name":"Bounded function","score":0.8621810674667358},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.787543535232544},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7616585493087769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7459756731987},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7161586880683899},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4757551848888397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1829637885093689}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8621810674667358},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.787543535232544},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7616585493087769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7459756731987},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7161586880683899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4757551848888397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1829637885093689},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2151171.2151181","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2151171.2151181","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:pure.atira.dk:publications/d35f1be9-5321-4e19-8fbf-c50c65a1fa08","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/d35f1be9-5321-4e19-8fbf-c50c65a1fa08","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, A, Husfeldt, T, Kaski, P & Koivisto, M 2012, 'The traveling salesman problem in bounded degree graphs', A C M Transactions on Algorithms, vol. 8, no. 2.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lup.lub.lu.se:5c8d7532-170b-4576-ad7e-4f60e1a2a469","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/2813087","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1549-6333","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8299999833106995,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G6722712325","display_name":null,"funder_award_id":"117499 (P.K.) and 109101 (M.K.)","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W158671191","https://openalex.org/W626292722","https://openalex.org/W1533818411","https://openalex.org/W1542928981","https://openalex.org/W1571087346","https://openalex.org/W1593916827","https://openalex.org/W1824848400","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1975286948","https://openalex.org/W2001868457","https://openalex.org/W2108350607","https://openalex.org/W2126436716","https://openalex.org/W2139935705","https://openalex.org/W2157827214","https://openalex.org/W2160392814","https://openalex.org/W2296469570","https://openalex.org/W2324108981","https://openalex.org/W2508797883","https://openalex.org/W4232236937","https://openalex.org/W4247491976","https://openalex.org/W4294358747","https://openalex.org/W4411370861","https://openalex.org/W6635454507","https://openalex.org/W6824878413"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W4389782626"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"the":[3,26,32,44,58,65,94],"traveling":[4],"salesman":[5],"problem":[6],"in":[7,13,105],"bounded-degree":[8,81],"graphs":[9],"can":[10],"be":[11],"solved":[12],"time":[14,75],"O":[15,76],"((2-\u03f5)":[16,77],"n":[17,36,78],"),":[18],"where":[19],"\u03f5":[20],"&gt;":[21],"0":[22],"depends":[23],"only":[24],"on":[25,31,64,80],"degree":[27],"bound":[28],"but":[29],"not":[30],"number":[33,101],"of":[34,43,60,90,96,102],"cities,":[35],".":[37],"The":[38],"algorithm":[39,72,92],"is":[40],"a":[41,70,99],"variant":[42],"classical":[45],"dynamic":[46],"programming":[47],"solution":[48],"due":[49],"to":[50],"Bellman,":[51],"and,":[52],"independently,":[53],"Held":[54],"and":[55],"Karp.":[56],"In":[57,83],"case":[59],"bounded":[61,100],"integer":[62],"weights":[63],"edges,":[66],"we":[67,85],"also":[68],"give":[69],"polynomial-space":[71],"with":[73,98],"running":[74],")":[79],"graphs.":[82],"addition,":[84],"present":[86],"an":[87],"analogous":[88],"analysis":[89],"Ryser's":[91],"for":[93],"permanent":[95],"matrices":[97],"nonzero":[103],"entries":[104],"each":[106],"column.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}
