LP-Based Approximation Algorithms for Traveling Salesman Path Problems
Hyung-Chan AnDavid B. ShmoysPublished in: CoRR (2011)
Keyphrases
- approximation algorithms
- traveling salesman
- vertex cover
- np hard
- primal dual
- minimum cost
- special case
- quadratic program
- randomized algorithms
- approximation schemes
- network design problem
- np hardness
- traveling salesman problem
- linear program
- exact algorithms
- worst case
- global optimization
- test problems
- np complete
- approximation ratio
- open shop
- cost function