Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
Flávio Keidi MiyazawaYoshiko WakabayashiPublished in: SIAM J. Comput. (1999)
Keyphrases
- approximation algorithms
- packing problem
- three dimensional
- np hard
- integer programming
- worst case
- special case
- bin packing
- vertex cover
- facility location problem
- open shop
- minimum cost
- arbitrary shaped
- constant factor
- primal dual
- network design problem
- set cover
- error bounds
- approximation ratio
- optimal solution
- approximation schemes
- randomized algorithms
- combinatorial auctions
- disjoint paths