{"id":"https://openalex.org/W2951388475","doi":"https://doi.org/10.1137/22m1469122","title":"An ETH-Tight Exact Algorithm for Euclidean TSP","display_name":"An ETH-Tight Exact Algorithm for Euclidean TSP","publication_year":2023,"publication_date":"2023-06-05","ids":{"openalex":"https://openalex.org/W2951388475","doi":"https://doi.org/10.1137/22m1469122","mag":"2951388475"},"language":"en","primary_location":{"id":"doi:10.1137/22m1469122","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1469122","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/491ee10a-62f2-4915-95ce-6548f3752b86","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, Eindhoven University of Technology, Eindhoven 5600 MB, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, Utrecht 3508 TB, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, Utrecht 3508 TB, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","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":"S\u00e1ndor Kisfaludi-Bak","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo FI-00076, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo FI-00076, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sudeshna Kolay","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":3,"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":0.5943,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68460334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"3","first_page":"740","last_page":"760"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9882000088691711,"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/metric","display_name":"Metric (unit)","score":0.6855891942977905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5900137424468994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5821832418441772},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5401045680046082},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.537334680557251},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48661431670188904},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.47775354981422424},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"Analysis of algorithms","score":0.45062828063964844},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4286336898803711},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.41115012764930725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40648919343948364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3350732922554016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3092581629753113}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6855891942977905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5900137424468994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5821832418441772},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5401045680046082},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.537334680557251},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48661431670188904},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.47775354981422424},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.45062828063964844},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4286336898803711},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.41115012764930725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40648919343948364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3350732922554016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3092581629753113},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/22m1469122","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1469122","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/491ee10a-62f2-4915-95ce-6548f3752b86","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/491ee10a-62f2-4915-95ce-6548f3752b86","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, Bodlaender, H L, Kisfaludi-Bak, S & Kolay, S 2023, 'An ETH-Tight Exact Algorithm for Euclidean TSP', SIAM Journal on Computing, vol. 52, no. 3, pp. 740-760. https://doi.org/10.1137/22M1469122","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/491ee10a-62f2-4915-95ce-6548f3752b86","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85165727857&partnerID=8YFLogxK","pdf_url":"https://pure.tue.nl/ws/files/313460337/22m1469122.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, Bodlaender, H L, Kisfaludi-Bak, S & Kolay, S 2023, 'An ETH-Tight Exact Algorithm for Euclidean TSP', SIAM Journal on Computing, vol. 52, no. 3, pp. 740-760. https://doi.org/10.1137/22M1469122","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/122683","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/fa68b3a4-b9c7-4fff-b20f-859c8c713eb3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/491ee10a-62f2-4915-95ce-6548f3752b86","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/491ee10a-62f2-4915-95ce-6548f3752b86","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, Bodlaender, H L, Kisfaludi-Bak, S & Kolay, S 2023, 'An ETH-Tight Exact Algorithm for Euclidean TSP', SIAM Journal on Computing, vol. 52, no. 3, pp. 740-760. https://doi.org/10.1137/22M1469122","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W16680773","https://openalex.org/W1930019869","https://openalex.org/W1971483538","https://openalex.org/W1975442866","https://openalex.org/W1982687611","https://openalex.org/W1985572324","https://openalex.org/W1994248285","https://openalex.org/W2012326410","https://openalex.org/W2020284736","https://openalex.org/W2037995626","https://openalex.org/W2055569927","https://openalex.org/W2066194644","https://openalex.org/W2106183852","https://openalex.org/W2116909526","https://openalex.org/W2117226423","https://openalex.org/W2165094933","https://openalex.org/W2165142526","https://openalex.org/W2168336253","https://openalex.org/W2180988813","https://openalex.org/W2235179049","https://openalex.org/W2407641981","https://openalex.org/W2794350243","https://openalex.org/W2914414140","https://openalex.org/W2951040439","https://openalex.org/W2964067126","https://openalex.org/W3112807772","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W4230677477","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947","https://openalex.org/W3102280101","https://openalex.org/W2963656294","https://openalex.org/W9190679","https://openalex.org/W3172736027","https://openalex.org/W2467234968","https://openalex.org/W3163362937"],"abstract_inverted_index":{"Publisher":[0],"Copyright:":[1],"Copyright":[2],"\u00a9":[3],"by":[4],"SIAM.":[5],"Unauthorized":[6],"reproduction":[7],"of":[8],"this":[9],"article":[10],"is":[11],"prohibited.":[12]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-10-10T00:00:00"}