A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

11/07/2020
by   Sándor Kisfaludi-Bak, et al.
0

We revisit the classic task of finding the shortest tour of n points in d-dimensional Euclidean space, for any fixed constant d ≥ 2. We determine the optimal dependence on ε in the running time of an algorithm that computes a (1+ε)-approximate tour, under a plausible assumption. Specifically, we give an algorithm that runs in 2^𝒪(1/ε^d-1) nlog n time. This improves the previously smallest dependence on ε in the running time (1/ε)^𝒪(1/ε^d-1)n log n of the algorithm by Rao and Smith (STOC 1998). We also show that a 2^o(1/ε^d-1)poly(n) algorithm would violate the Gap-Exponential Time Hypothesis (Gap-ETH). Our new algorithm builds upon the celebrated quadtree-based methods initially proposed by Arora (J. ACM 1998), but it adds a simple new idea that we call sparsity-sensitive patching. On a high level this lets the granularity with which we simplify the tour depend on how sparse it is locally. Our approach is (arguably) simpler than the one by Rao and Smith since it can work without geometric spanners. We demonstrate the technique extends easily to other problems, by showing as an example that it also yields a Gap-ETH-tight approximation scheme for Rectilinear Steiner Tree.

READ FULL TEXT

page 28

page 31

research
07/16/2023

Faster Approximation Schemes for k-TSP and k-MST in the Euclidean Space

In the Euclidean k-TSP (resp. Euclidean k-MST), we are given n points in...
research
08/15/2023

A Nearly Quadratic-Time FPTAS for Knapsack

We investigate polynomial-time approximation schemes for the classic 0-1...
research
02/16/2022

Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime

We revisit the task of computing the edit distance in sublinear time. In...
research
07/26/2016

Approximation and Parameterized Complexity of Minimax Approval Voting

We present three results on the complexity of Minimax Approval Voting. F...
research
03/16/2022

Tight Lower Bounds for Approximate Exact k-Center in ℝ^d

In the discrete k-center problem, we are given a metric space (P,) where...
research
07/18/2018

An ETH-Tight Exact Algorithm for Euclidean TSP

We study exact algorithms for Euclidean TSP in R^d. In the early 1990s ...
research
08/15/2020

On Efficient Low Distortion Ultrametric Embedding

A classic problem in unsupervised learning and data analysis is to find ...

Please sign up or login with your details

Forgot password? Click here to reset