Improved approximation algorithms for multidimensional bin packing problems.
Nikhil BansalAlberto CapraraMaxim SviridenkoPublished in: FOCS (2006)
Keyphrases
- approximation algorithms
- packing problem
- np hard
- special case
- cutting stock
- vertex cover
- worst case
- minimum cost
- facility location problem
- bin packing
- open shop
- np hardness
- primal dual
- set cover
- network design problem
- approximation ratio
- constant factor
- approximation schemes
- randomized algorithms
- disjoint paths
- lot sizing
- polynomial time approximation