Approximation Algorithms for Generalized and Variable-Sized Bin Covering.
Matthias HellwigAlexander SouzaPublished in: APPROX-RANDOM (2012)
Keyphrases
- variable sized
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- approximation ratio
- exact algorithms
- network design problem
- np hardness
- facility location problem
- set cover
- randomized algorithms
- primal dual
- polynomial time approximation
- disjoint paths
- precedence constraints
- undirected graph
- lower bound
- approximation schemes
- upper bound
- constant factor
- genetic algorithm