{"id":"https://openalex.org/W2486127132","doi":"https://doi.org/10.1145/3414845","title":"Fine-grained Complexity Analysis of Two Classic TSP Variants","display_name":"Fine-grained Complexity Analysis of Two Classic TSP Variants","publication_year":2020,"publication_date":"2020-12-31","ids":{"openalex":"https://openalex.org/W2486127132","doi":"https://doi.org/10.1145/3414845","mag":"2486127132"},"language":"en","primary_location":{"id":"doi:10.1145/3414845","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3414845","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":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/182724503/3414845.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077490455","display_name":"Kevin Buchin","orcid":"https://orcid.org/0000-0002-3022-7877"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Kevin Buchin","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gerhard Woeginger","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":1.5882,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86681077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9922000169754028,"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/bottleneck","display_name":"Bottleneck","score":0.6749976873397827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6696142554283142},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.611361563205719},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6019260883331299},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5726221799850464},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5471226572990417},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4955397844314575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48448511958122253},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4757692217826843},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42808863520622253},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4267650544643402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4074639678001404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.362507164478302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36121049523353577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29608309268951416}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6749976873397827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6696142554283142},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.611361563205719},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6019260883331299},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5726221799850464},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5471226572990417},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4955397844314575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48448511958122253},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4757692217826843},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42808863520622253},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4267650544643402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4074639678001404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.362507164478302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36121049523353577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29608309268951416},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/3414845","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3414845","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.tue.nl:openaire_cris_publications/783580a6-48fc-4ea1-9889-cded5248efe0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/783580a6-48fc-4ea1-9889-cded5248efe0","pdf_url":"https://pure.tue.nl/ws/files/182724503/3414845.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M T, Buchin, K, Jansen, B M P & Woeginger, G 2021, 'Fine-grained Complexity Analysis of Two Classic TSP Variants', ACM Transactions on Algorithms, vol. 17, no. 1, 5. https://doi.org/10.1145/3414845","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b43c6a6d-576e-44b1-b9b7-1e7e35be3a6b","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/b43c6a6d-576e-44b1-b9b7-1e7e35be3a6b","pdf_url":"https://research.tue.nl/nl/publications/b43c6a6d-576e-44b1-b9b7-1e7e35be3a6b","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv. Cornell University Library","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/b43c6a6d-576e-44b1-b9b7-1e7e35be3a6b","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/b43c6a6d-576e-44b1-b9b7-1e7e35be3a6b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg , M T , Buchin , K A , Jansen , B M P & Woeginger , G J 2016 , ' Fine-grained complexity analysis of two classic TSP variants ' , arXiv , no. 1607.02725v1 . < https://arxiv.org/abs/1607.02725 >","raw_type":"article"},{"id":"pmh:tue:oai:library.tue.nl:857862","is_oa":false,"landing_page_url":"http://repository.tue.nl/857862","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:library.tue.nl:857960","is_oa":false,"landing_page_url":"http://repository.tue.nl/857960","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:883011","is_oa":false,"landing_page_url":"http://repository.tue.nl/883011","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:883974","is_oa":false,"landing_page_url":"http://repository.tue.nl/883974","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:pure.tue.nl:publications/783580a6-48fc-4ea1-9889-cded5248efe0","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/783580a6-48fc-4ea1-9889-cded5248efe0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 17(1):5. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/783580a6-48fc-4ea1-9889-cded5248efe0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/783580a6-48fc-4ea1-9889-cded5248efe0","pdf_url":"https://pure.tue.nl/ws/files/182724503/3414845.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M T, Buchin, K, Jansen, B M P & Woeginger, G 2021, 'Fine-grained Complexity Analysis of Two Classic TSP Variants', ACM Transactions on Algorithms, vol. 17, no. 1, 5. https://doi.org/10.1145/3414845","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6000000238418579,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6502373665","display_name":null,"funder_award_id":"Gravity","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6900544221","display_name":null,"funder_award_id":"612.001.207","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2486127132.pdf","grobid_xml":"https://content.openalex.org/works/W2486127132.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W93177885","https://openalex.org/W1552810675","https://openalex.org/W1571087346","https://openalex.org/W1764956874","https://openalex.org/W1923819040","https://openalex.org/W1968301997","https://openalex.org/W1973046087","https://openalex.org/W1979630448","https://openalex.org/W1984604031","https://openalex.org/W1995725694","https://openalex.org/W2011297770","https://openalex.org/W2027387410","https://openalex.org/W2045424410","https://openalex.org/W2045859197","https://openalex.org/W2055693471","https://openalex.org/W2059985428","https://openalex.org/W2070164574","https://openalex.org/W2072008504","https://openalex.org/W2072985157","https://openalex.org/W2079868147","https://openalex.org/W2084803275","https://openalex.org/W2088968237","https://openalex.org/W2100503751","https://openalex.org/W2106371135","https://openalex.org/W2106378689","https://openalex.org/W2108741984","https://openalex.org/W2113885662","https://openalex.org/W2121770144","https://openalex.org/W2132026455","https://openalex.org/W2135149549","https://openalex.org/W2140752352","https://openalex.org/W2148673189","https://openalex.org/W2150256023","https://openalex.org/W2151944609","https://openalex.org/W2167469500","https://openalex.org/W2207058206","https://openalex.org/W2404196336","https://openalex.org/W2568603896","https://openalex.org/W2604874681","https://openalex.org/W2618199688","https://openalex.org/W2980171939","https://openalex.org/W3031315587","https://openalex.org/W4327812391"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W3125086224","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W4287815058","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"We":[0,376],"analyze":[1],"two":[2,50,446],"classic":[3,56],"variants":[4],"of":[5,19,25,38,49,74,169,204,295,334,366],"the":[6,17,30,42,71,101,150,156,167,172,186,194,199,207,216,223,249,296,350,362,382,390,426,439,453],"T":[7],"RAVELING":[8],"S":[9,83,311],"ALESMAN":[10],"P":[11,313],"ROBLEM":[12],"(":[13,65,129,142,264,336,342,372,396,420],"TSP":[14,33,126,154,189,196,214],")":[15,68,134,147,267,301,338,347,403,423],"using":[16],"toolkit":[18],"fine-grained":[20],"complexity.":[21],"Our":[22,183,201],"first":[23],"set":[24,37,203],"results":[26,205,355],"is":[27,54,174,278,329,370,380],"motivated":[28],"by":[29,238,251,384],"B":[31],"ITONIC":[32],"problem:":[34],"given":[35,233],"a":[36,45,55,232,239,293,332],"n":[39,66,130,133,143,146,165,265,299,340,373,397,421],"points":[40,157,451],"in":[41,63,114,127,140,171,198,215,248,262,315,394,418,445,452],"plane,":[43],"compute":[44],"shortest":[46],"tour":[47,234,250],"consisting":[48],"monotone":[51],"chains.":[52],"It":[53],"dynamic-programming":[57],"exercise":[58],"to":[59,96,158,176,281,437,459],"solve":[60,460],"this":[61,277,379],"problem":[62,190,197],"O":[64,128,141,263,395,419],"2":[67,132,399],"time.":[69,116,148],"While":[70],"near-quadratic":[72],"dependency":[73],"similar":[75],"dynamic":[76],"programs":[77],"for":[78,185,193,213,269,356,405,429,442,450],"L":[79],"ONGEST":[80],"C":[81],"OMMON":[82],"UBSEQUENCE":[84],"and":[85,136,166,304,455],"D":[86,90],"ISCRETE":[87],"F":[88],"r\u00e9chet":[89],"istance":[91],"has":[92,318],"recently":[93],"been":[94],"proven":[95],"be":[97,112,159,236,282,416],"essentially":[98],"optimal":[99],"under":[100],"Strong":[102],"Exponential":[103,351],"Time":[104,352],"Hypothesis,":[105],"we":[106,119,221,287,434,457],"show":[107,377,435],"that":[108,123,244,289,331,361,378,388,412],"bitonic":[109,125,187],"tours":[110],"can":[111,235,415],"found":[113],"subquadratic":[115],"More":[117,219],"precisely,":[118,220],"present":[120],"an":[121,290,320,386],"algorithm":[122,257,291,387,428],"solves":[124,258],"log":[131,144,345],"time":[135,268,364,404],"its":[137],"bottleneck":[138],"version":[139],"3":[145,422],"In":[149],"more":[151],"general":[152,323],"pyramidal":[153,195],"problem,":[155,228],"visited":[160],"are":[161],"labeled":[162],"1,\u2026":[163],",":[164,276,327],"sequence":[168],"labels":[170],"solution":[173],"required":[175],"have":[177],"at":[178],"most":[179],"one":[180],"local":[181],"maximum.":[182],"algorithms":[184],"(bottleneck)":[188],"also":[191],"work":[192],"plane.":[200],"second":[202],"concerns":[206],"popular":[208],"k":[209,224,240,246,252,259,266,271,285,324,337,343,346,357,367,374,392,400,407,443],"-":[210,225,241,260,325,368],"OPT":[211,226,242,261,275,326,369,414,431,462],"heuristic":[212],"graph":[217],"setting.":[218],"study":[222],"decision":[227],"which":[229],"asks":[230],"whether":[231],"improved":[237],"move":[243],"replaces":[245],"edges":[247],"new":[253],"edges.":[254],"A":[255,307],"simple":[256],"fixed":[270,406],".":[272,432],"For":[273,284,322],"2-":[274,461],"easily":[279],"seen":[280],"optimal.":[283],"=3,":[286],"prove":[288],"with":[292],"runtime":[294,333],"form":[297],"\u00d5(":[298],"3\u2212\u025b":[300],"exists":[302],"if":[303,306],"only":[305],"LL":[308],"-P":[309],"AIRS":[310],"HORTEST":[312],"ATHS":[314],"weighted":[316],"digraphs":[317],"such":[319],"algorithm.":[321],"it":[328],"known":[330],"f":[335],"\u00b7":[339],"o":[341],"/":[344],"would":[348],"contradict":[349],"Hypothesis.":[353],"The":[354],"=2,3":[358],"may":[359],"suggest":[360],"actual":[363],"complexity":[365],"\u0398":[371],").":[375],"not":[381],"case,":[383],"presenting":[385],"finds":[389],"best":[391],"-move":[393],"\u230a":[398],"/3":[401],"\u230b+1":[402],"\u2265":[408],"3.":[409],"This":[410],"implies":[411],"4-":[413],"solved":[417],"time,":[424],"matching":[425],"best-known":[427],"3-":[430],"Finally,":[433],"how":[436],"beat":[438],"quadratic":[440],"barrier":[441],"=2":[444],"important":[447],"settings,":[448],"namely,":[449],"plane":[454],"when":[456],"want":[458],"repeatedly.":[463]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}