The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme.
Yair BartalLee-Ad GottliebRobert KrauthgamerPublished in: STOC (2012)
Keyphrases
- polynomial time approximation
- traveling salesman problem
- error bounds
- low dimensionality
- approximation algorithms
- np hard
- ant colony optimization
- combinatorial optimization
- optimization problems
- traveling salesman
- hamiltonian cycle
- worst case
- metaheuristic
- feature space
- high dimensionality
- low dimensional
- bin packing
- special case
- search space