A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.
Sándor Kisfaludi-BakJesper NederlofKarol WegrzyckiPublished in: CoRR (2020)
Keyphrases
- polynomial time approximation
- approximation schemes
- traveling salesman problem
- error bounds
- lower bound
- conjugate gradient algorithm
- approximation algorithms
- polynomial approximation
- np hard
- randomized approximation
- genetic algorithm
- approximation methods
- approximation error
- combinatorial optimization
- multiresolution
- high dimensional
- computational complexity
- optimal solution
- learning algorithm