A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.
Sándor Kisfaludi-BakJesper NederlofKarol WegrzyckiPublished in: FOCS (2022)
Keyphrases
- polynomial time approximation
- traveling salesman problem
- upper bound
- randomized approximation
- approximation schemes
- lower bound
- numerical scheme
- classification scheme
- approximation algorithms
- ant colony optimization
- euclidean space
- optimal solution
- polynomial approximation
- lie group
- np hard
- euclidean distance
- worst case
- multiresolution
- detection scheme
- combinatorial optimization
- recognition scheme
- closed form
- linear programming
- special case