Approximation Algorithms for Variable-Sized and Generalized Bin Covering
Matthias HellwigAlexander SouzaPublished in: CoRR (2011)
Keyphrases
- approximation algorithms
- variable sized
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- exact algorithms
- primal dual
- approximation ratio
- set cover
- polynomial time approximation
- constant factor
- undirected graph
- combinatorial auctions
- disjoint paths
- randomized algorithms
- open shop
- network flow
- strongly np hard