Approximation Hardness of TSP with Bounded Metrics.
Lars EngebretsenMarek KarpinskiPublished in: ICALP (2001)
Keyphrases
- traveling salesman problem
- np hard
- continuous functions
- computational complexity
- travelling salesman
- approximation algorithms
- combinatorial optimization
- worst case
- approximation error
- approximation ratio
- approximation schemes
- data sets
- ant colony optimization
- closed form
- phase transition
- queueing networks
- information theoretic
- np complete
- simulated annealing
- quality measures
- search space
- satisfy the triangle inequality