Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.
Paolo Dell'OlmoMaria Grazia SperanzaPublished in: Discret. Appl. Math. (1999)
Keyphrases
- approximation algorithms
- constant factor
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- constant factor approximation
- network design problem
- np hardness
- lower bound
- exact algorithms
- approximation ratio
- set cover
- computational complexity
- randomized algorithms
- approximation schemes
- polynomial time approximation
- disjoint paths