The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
Yair BartalLee-Ad GottliebRobert KrauthgamerPublished in: CoRR (2011)
Keyphrases
- polynomial time approximation
- traveling salesman problem
- low dimensionality
- np hard
- approximation algorithms
- ant colony optimization
- error bounds
- combinatorial optimization
- hamiltonian cycle
- optimization problems
- high dimensionality
- valid inequalities
- bin packing
- traveling salesman
- special case
- worst case
- low dimensional
- minimum cost