On the Approximation Hardness of Some Generalizations of TSP.
Hans-Joachim BöckenhauerJuraj HromkovicJoachim KneisJoachim KupkePublished in: SWAT (2006)
Keyphrases
- traveling salesman problem
- np hard
- travelling salesman
- approximation algorithms
- genetic algorithm
- phase transition
- linear programming
- ant colony optimization
- worst case
- search space
- computational complexity
- agnostic learning
- graphical models
- optimization problems
- information theoretic
- special case
- approximation methods
- approximation ratio
- knowledge base