Approximation algorithms for orthogonal packing problems for hypercubes.
Rolf HarrenPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- approximation algorithms
- packing problem
- np hard
- bin packing
- special case
- worst case
- integer programming
- vertex cover
- cutting stock
- minimum cost
- facility location problem
- network design problem
- randomized algorithms
- set cover
- open shop
- approximation ratio
- primal dual
- np hardness
- constant factor
- combinatorial auctions
- computational complexity
- approximation guarantees
- precedence constraints
- approximation schemes