A Linear Time Approximation Scheme for Euclidean TSP.
Yair BartalLee-Ad GottliebPublished in: FOCS (2013)
Keyphrases
- polynomial time approximation
- traveling salesman problem
- approximation schemes
- approximation algorithms
- error bounds
- polynomial approximation
- combinatorial optimization
- worst case
- ant colony optimization
- np hard
- classification scheme
- approximation error
- learning algorithm
- genetic algorithm
- closed form
- query processing
- multiresolution
- search space
- euclidean space
- detection scheme
- recognition scheme
- optimal solution