A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.
Sándor Kisfaludi-BakJesper NederlofKarol WegrzyckiPublished in: FOCS (2021)
Keyphrases
- polynomial time approximation
- approximation schemes
- polynomial approximation
- np hard
- traveling salesman problem
- lower bound
- approximation methods
- upper bound
- euclidean distance
- error bounds
- approximation algorithms
- ant colony optimization
- relative error
- combinatorial optimization
- conjugate gradient algorithm
- search space
- travelling salesman
- data sets
- randomized approximation
- representation scheme
- model selection
- worst case
- optimal solution
- image segmentation