Approximation Algorithms for the Class Cover Problem.
Adam CannonLenore CowenPublished in: AI&M (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- exact algorithms
- vertex cover
- worst case
- minimum cost
- facility location problem
- randomized algorithms
- network design problem
- approximation ratio
- precedence constraints
- approximation schemes
- primal dual
- open shop
- set cover
- lower bound
- approximation guarantees
- disjoint paths