{"id":"https://openalex.org/W4404356260","doi":"https://doi.org/10.4230/lipics.socg.2026.64","title":"A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP","display_name":"A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP","publication_year":2024,"publication_date":"2024-11-04","ids":{"openalex":"https://openalex.org/W4404356260","doi":"https://doi.org/10.4230/lipics.socg.2026.64"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2411.02585","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.02585","pdf_url":"https://arxiv.org/pdf/2411.02585","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2411.02585","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kisfaludi-Bak, S\u00e1ndor","orcid":"https://orcid.org/0000-0002-6856-2902"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-6856-2902","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Odak, Saeed","orcid":"https://orcid.org/0009-0005-6290-0965"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Odak, Saeed","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0009-0005-6290-0965","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Singh, Satyam","orcid":"https://orcid.org/0009-0005-0873-066X"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Singh, Satyam","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0009-0005-0873-066X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":null,"display_name":"van Wordragen, Geert","orcid":"https://orcid.org/0000-0002-2650-638X"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"van Wordragen, Geert","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-2650-638X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.48989999294281006,"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/T12176","display_name":"Optimization and Packing Problems","score":0.48989999294281006,"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/T12288","display_name":"Optimization and Search Problems","score":0.4366999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4129999876022339,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/euclidean-geometry","display_name":"Euclidean geometry","score":0.6309407949447632},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5789116024971008},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5132722854614258},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4274086356163025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40093833208084106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3609979748725891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.355348140001297},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2700568437576294},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2297619879245758},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2229524850845337}],"concepts":[{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6309407949447632},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5789116024971008},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5132722854614258},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4274086356163025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40093833208084106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3609979748725891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.355348140001297},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2700568437576294},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2297619879245758},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2229524850845337}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:arXiv.org:2411.02585","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.02585","pdf_url":"https://arxiv.org/pdf/2411.02585","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:doi:10.4230/lipics.socg.2026.64","is_oa":true,"landing_page_url":"http://eccc.hpi-web.de/report/2016/128","pdf_url":"https://eccc.weizmann.ac.il/report/2016/128/download","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25871","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.64","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.64/LIPIcs.SoCG.2026.64.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/146121","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/ab666239-7812-4556-bd34-1074effda4d0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2411.02585","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2411.02585","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.socg.2026.64","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.64","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2411.02585","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.02585","pdf_url":"https://arxiv.org/pdf/2411.02585","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5366579925","display_name":"Techniken f\u00fcr Effiziente Algorithmen mit Limitierten Ressourcen","funder_award_id":"439522729","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7457327354","display_name":"Neuartige Approximationstechniken f\u00fcr Traveling Salesman Probleme","funder_award_id":"439637648","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":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4404356260.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W1975289146","https://openalex.org/W2897501241","https://openalex.org/W2295683163","https://openalex.org/W2198688435","https://openalex.org/W3003054808","https://openalex.org/W2997055194"],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"in":[5,67,74,88],"the":[6,12,32,40],"$d$-dimensional":[7],"Euclidean":[8,139],"space":[9],"is":[10,72,102,122],"among":[11],"oldest":[13],"and":[14,27,44,58,79,112],"most":[15],"famous":[16],"NP-hard":[17],"optimization":[18],"problems.":[19],"In":[20],"breakthrough":[21],"works,":[22],"Arora":[23],"[J.":[24],"ACM":[25],"1998]":[26,47],"Mitchell":[28],"[SICOMP":[29],"1999]":[30],"gave":[31,48,62,83],"first":[33],"polynomial":[34],"time":[35,54,119,135],"approximation":[36,55,65,86,136],"schemes.":[37],"To":[38],"improve":[39],"running":[41,118],"time,":[42,70,93],"Rao":[43],"Smith":[45],"[STOC":[46],"a":[49,63,84,95,105,117,131],"randomized":[50,64,85,132],"$(1/\\varepsilon)^{O(1/\\varepsilon^{d-1})}\\cdot":[51],"n\\log":[52],"n$":[53,69,92,134],"scheme.":[56],"Bartal":[57],"Gottlieb":[59],"[FOCS":[60,81,114],"2013]":[61],"scheme":[66,87,137],"$2^{(1/\\varepsilon)^{O(d)}}":[68],"which":[71],"linear":[73],"$n$.":[75],"Recently,":[76],"Kisfaludi-Bak,":[77,110],"Nederlof,":[78,111],"W\u0119grzycki":[80,113],"2021]":[82,115],"$2^{O(1/\\varepsilon^{d-1})}":[89,133],"n":[90],"\\log":[91],"achieving":[94],"Gap-ETH":[96],"tight":[97],"dependence":[98],"on":[99],"$\\varepsilon$.":[100],"It":[101],"raised":[103],"as":[104],"challenging":[106],"open":[107],"question":[108,127],"by":[109,129],"whether":[116],"of":[120],"$2^{O(1/\\varepsilon^{d-1})}n$":[121],"achievable.":[123],"We":[124],"answer":[125],"their":[126],"positively":[128],"giving":[130],"for":[138],"TSP.":[140]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2024-11-15T00:00:00"}