Approximation Algorithms for k-Hurdle Problems.
Brian C. DeanAdam GriffisAdam A. WhitleyPublished in: LATIN (2008)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- special case
- approximation schemes
- np hardness
- randomized algorithms
- exact algorithms
- minimum cost
- network design problem
- worst case
- optimal solution
- approximation ratio
- primal dual
- np complete
- facility location problem
- dynamic programming
- lower bound
- computational complexity