The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme.
Yair BartalLee-Ad GottliebRobert KrauthgamerPublished in: SIAM J. Comput. (2016)
Keyphrases
- polynomial time approximation
- traveling salesman problem
- np hard
- approximation algorithms
- error bounds
- low dimensionality
- combinatorial optimization
- ant colony optimization
- optimization problems
- traveling salesman
- hamiltonian cycle
- bin packing
- high dimensionality
- genetic algorithm
- linear programming
- evolutionary algorithm
- high dimensional