Better approximation algorithms for bin covering.
János CsirikDavid S. JohnsonClaire KenyonPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- open shop
- minimum cost
- exact algorithms
- set cover
- worst case
- facility location problem
- randomized algorithms
- network design problem
- approximation ratio
- constant factor
- disjoint paths
- undirected graph
- precedence constraints
- approximation guarantees
- primal dual
- strongly np hard
- multistage