Approximation Hardness of TSP with Bounded Metrics
Lars EngebretsenMarek KarpinskiPublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- traveling salesman problem
- np hard
- continuous functions
- approximation algorithms
- approximation error
- search space
- genetic algorithm
- relative error
- evaluation metrics
- error bounds
- data sets
- ant colony optimization
- travelling salesman
- approximation methods
- combinatorial optimization
- closed form
- np complete
- worst case
- computational complexity
- case study
- asymptotically optimal
- data structure
- optimal solution
- learning algorithm
- neural network