Approximation algorithms for the watchman route and zookeeper's problems.
Xuehou TanPublished in: Discret. Appl. Math. (2004)
Keyphrases
- approximation algorithms
- vertex cover
- special case
- np hard
- approximation schemes
- network design problem
- np hardness
- randomized algorithms
- worst case
- exact algorithms
- disjoint paths
- minimum cost
- constant factor approximation
- primal dual
- practical problems
- np complete
- approximation ratio
- constant factor
- polynomial time approximation
- optimization problems