Approximation Algorithms for the Class Cover Problem.
Adam CannonLenore CowenPublished in: Ann. Math. Artif. Intell. (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- exact algorithms
- approximation schemes
- facility location problem
- primal dual
- network design problem
- set cover
- approximation ratio
- randomized algorithms
- constant factor
- open shop
- constant factor approximation
- disjoint paths
- np hardness
- approximation guarantees
- learning algorithm
- undirected graph
- scheduling problem
- active learning