Approximation algorithms for multiple terminal, Hamiltonian path problems.
Jungyun BaeSivakumar RathinamPublished in: Optim. Lett. (2012)
Keyphrases
- approximation algorithms
- vertex cover
- approximation schemes
- np hard
- exact algorithms
- np hardness
- hamiltonian path
- facility location problem
- special case
- minimum cost
- network design problem
- randomized algorithms
- disjoint paths
- np complete
- optimization problems
- quadratic program
- worst case
- primal dual
- set cover
- constant factor
- simulated annealing