Improved deterministic approximation algorithms for Max TSP.
Zhi-Zhong ChenYuusuke OkamotoLusheng WangPublished in: Inf. Process. Lett. (2005)
Keyphrases
- approximation algorithms
- np hard
- randomized algorithms
- special case
- vertex cover
- worst case
- traveling salesman problem
- minimum cost
- approximation guarantees
- facility location problem
- network design problem
- primal dual
- approximation schemes
- set cover
- approximation ratio
- exact algorithms
- open shop
- optimal solution
- constant factor approximation
- integer programming
- ant colony optimization
- lower bound
- constant factor
- greedy algorithm
- polynomial time approximation
- linear programming
- search space