@inproceedings{9af2a346d36f4d298910f9befc70dc95,
title = "An ETH-tight exact algorithm for euclidean TSP",
abstract = " We study exact algorithms for E UCLIDEAN TSP in ℝ d . In the early 1990s algorithms with n O(√n) running time were presented for the planar case, and some years later an algorithm with n O(n1-1/d) running time was presented for any d ≧ 2. Despite significant interest in subexponential exact algorithms over the past decade, there has been no progress on EUCLIDEAN TSP, except for a lower bound stating that the problem admits no 2O(n 1-1/d-ϵ ) algorithm unless ETH fails. Up to constant factors in the exponent, we settle the complexity of E UCLIDEAN TSP by giving a 2 O(n-1/d) algorithm and by showing that a 2 o(n1-1/d ) algorithm does not exist unless ETH fails.",
keywords = "ETH, Euclidean TSP, Separator theorem, Subexponential algorithms",
author = "{De Berg}, Mark and Bodlaender, {Hans L.} and S{\'a}ndor Kisfaludi-Bak and Sudeshna Kolay",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018 ; Conference date: 07-10-2018 Through 09-10-2018",
year = "2018",
month = nov,
day = "30",
doi = "10.1109/FOCS.2018.00050",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "450--461",
editor = "Mikkel Thorup",
booktitle = "Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018",
address = "United States",
}