{"id":"https://openalex.org/W3033696807","doi":"https://doi.org/10.1145/3382038","title":"Time- and Space-optimal Algorithm for the Many-visits TSP","display_name":"Time- and Space-optimal Algorithm for the Many-visits TSP","publication_year":2020,"publication_date":"2020-06-06","ids":{"openalex":"https://openalex.org/W3033696807","doi":"https://doi.org/10.1145/3382038","mag":"3033696807"},"language":"en","primary_location":{"id":"doi:10.1145/3382038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382038","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.15480/882.2590","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075001728","display_name":"Andr\u00e9 Berger","orcid":"https://orcid.org/0000-0002-6409-1963"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Berger","raw_affiliation_strings":["Maastricht University, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maastricht University, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065214797","display_name":"L\u00e1szl\u00f3 Kozma","orcid":"https://orcid.org/0000-0002-3253-2373"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"L\u00e1szl\u00f3 Kozma","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053266341","display_name":"Matthias Mnich","orcid":"https://orcid.org/0000-0002-4721-5354"},"institutions":[{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Mnich","raw_affiliation_strings":["Technische Universit\u00e4t Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4721-5354","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Hamburg, Germany","institution_ids":["https://openalex.org/I884043246"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055303116","display_name":"Roland Vincze","orcid":"https://orcid.org/0000-0002-5997-6564"},"institutions":[{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roland Vincze","raw_affiliation_strings":["Technische Universit\u00e4t Hamburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Hamburg, Germany","institution_ids":["https://openalex.org/I884043246"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075001728"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":null,"apc_paid":null,"fwci":1.1561,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8329289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"3","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9986000061035156,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5799520015716553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5199031233787537},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5074517130851746},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5020921230316162},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47832751274108887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4768175482749939},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4744354784488678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47092241048812866},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4261905252933502},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4125230014324188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34653741121292114}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5799520015716553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5199031233787537},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5074517130851746},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5020921230316162},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47832751274108887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4768175482749939},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4744354784488678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47092241048812866},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4261905252933502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4125230014324188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34653741121292114},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3382038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382038","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:cris.maastrichtuniversity.nl:openaire_cris_publications/91257b03-a80a-462a-8838-abbfbd56dea5","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/91257b03-a80a-462a-8838-abbfbd56dea5","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berger, A, Kozma, L, Mnich, M & Vincze, R 2020, 'Time- and Space-optimal Algorithm for the Many-visits TSP', ACM Transactions on Algorithms, vol. 16, no. 3, 35. https://doi.org/10.1145/3382038","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:null:11420/4450","is_oa":false,"landing_page_url":"http://hdl.handle.net/11420/4450","pdf_url":null,"source":{"id":"https://openalex.org/S4306401751","display_name":"tub.dok (Hamburg University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I884043246","host_organization_name":"Hamburg University of Technology","host_organization_lineage":["https://openalex.org/I884043246"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"doi:10.15480/882.2590","is_oa":true,"landing_page_url":"https://doi.org/10.15480/882.2590","pdf_url":null,"source":{"id":"https://openalex.org/S7407052987","display_name":"TUHH Open Research","issn_l":null,"issn":[],"is_oa":false,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.15480/882.2590","is_oa":true,"landing_page_url":"https://doi.org/10.15480/882.2590","pdf_url":null,"source":{"id":"https://openalex.org/S7407052987","display_name":"TUHH Open Research","issn_l":null,"issn":[],"is_oa":false,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":""},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8100000023841858,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G8723353983","display_name":null,"funder_award_id":"MN 59/4-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":38,"referenced_works":["https://openalex.org/W193938304","https://openalex.org/W307896644","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1979460017","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W1999466794","https://openalex.org/W1999832757","https://openalex.org/W2004739738","https://openalex.org/W2012473793","https://openalex.org/W2018480107","https://openalex.org/W2018850502","https://openalex.org/W2024133435","https://openalex.org/W2032419831","https://openalex.org/W2034550441","https://openalex.org/W2038071774","https://openalex.org/W2042706779","https://openalex.org/W2048068744","https://openalex.org/W2063409331","https://openalex.org/W2065889460","https://openalex.org/W2073647226","https://openalex.org/W2076099212","https://openalex.org/W2086091870","https://openalex.org/W2107481047","https://openalex.org/W2112021853","https://openalex.org/W2114616381","https://openalex.org/W2140987434","https://openalex.org/W2155178472","https://openalex.org/W2156036190","https://openalex.org/W2328725012","https://openalex.org/W2471508234","https://openalex.org/W2737622315","https://openalex.org/W3041686293","https://openalex.org/W4229972189","https://openalex.org/W4242314863","https://openalex.org/W4242361212","https://openalex.org/W6738002306"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0,44,59,125,184],"many-visits":[1],"traveling":[2],"salesperson":[3],"problem":[4,46,204],"(MV-TSP)":[5],"asks":[6],"for":[7,63,145],"an":[8,164,235],"optimal":[9],"tour":[10],"of":[11,24,55,96,112,131,151,179,187,194,229,246],"n":[12,77,90],"cities":[13,132],"that":[14,167],"visits":[15],"each":[16],"city":[17,34],"c":[18,23,84,86,109,111],"a":[19,33,37,41,242],"prescribed":[20],"number":[21,130,178],"k":[22,85,110],"times.":[25],"Travel":[26],"costs":[27],"may":[28,39],"be":[29,206],"asymmetric,":[30],"and":[31,53,69,88,137,197,217,221,231,241],"visiting":[32],"twice":[35],"in":[36,49,75,133,169,176,208],"row":[38],"incur":[40],"non-zero":[42],"cost.":[43],"MV-TSP":[45,64,165],"finds":[47],"applications":[48],"scheduling,":[50],"geometric":[51],"approximation,":[52],"Hamiltonicity":[54],"certain":[56],"graph":[57],"families.":[58],"fastest":[60],"known":[61],"algorithm":[62,99,117,143,166,189,214],"is":[65,100,190,215],"due":[66],"to":[67,118,223],"Cosmadakis":[68,230],"Papadimitriou":[70],"(SICOMP,":[71],"1984).":[72],"It":[73,233],"runs":[74,168],"time":[76,136,170,209],"O(n)":[78,172],"+":[79],"O(n":[80],"3":[81],"log":[82],"\u2211":[83,108],")":[87],"requires":[89],"\u1dbf(n)":[91],"space.":[92,183],"An":[93],"interesting":[94],"feature":[95],"the":[97,105,113,116,129,135,142,148,160,177,192,195,199,203,226],"Cosmadakis-Papadimitriou":[98,161],"its":[101],"logarithmic":[102],"dependence":[103,127],"on":[104,128],"total":[106],"length":[107],"tour,":[114],"allowing":[115],"handle":[119],"instances":[120],"with":[121],"very":[122],"long":[123],"tours.":[124],"superexponential":[126],"both":[134,219],"space":[138,185],"complexity,":[139],"however,":[140],"renders":[141],"impractical":[144],"all":[146],"but":[147],"narrowest":[149],"range":[150],"this":[152,155],"parameter.":[153],"In":[154],"article,":[156],"we":[157],"improve":[158],"upon":[159],"algorithm,":[162],"giving":[163],"2":[171,210],",":[173],"i.e.,":[174],"single-exponential":[175],"cities,":[180],"using":[181],"polynomial":[182],"requirement":[186],"our":[188],"(essentially)":[191],"size":[193],"output,":[196],"assuming":[198],"Exponential-Time":[200],"Hypothesis":[201],"(ETH),":[202],"cannot":[205],"solved":[207],"o(n)":[211],".":[212],"Our":[213],"deterministic,":[216],"arguably":[218],"simpler":[220],"easier":[222],"analyze":[224],"than":[225],"original":[227],"approach":[228],"Papadimitriou.":[232],"involves":[234],"optimization":[236],"over":[237],"directed":[238],"spanning":[239],"trees":[240],"recursive,":[243],"centroid-based":[244],"decomposition":[245],"trees.":[247]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}