Approximation schemes for multidimensional packing

We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results are: an asymptotic polynomial time approximation scheme for packing ddimensional cubes into the minimum number of unit cubes and a polynomial time algorithm for packing rectangles into at most OPT bins whose sides have length (1 + ), where OPT denotes the minimum number of unit bins required to pack the rectangles. Both algorithms also achieve the best possible additive constant term. For cubes, this settles the approximability of the problem and represents a significant improvement over the previous best known asymptotic approximation factor of 2 - (2/3)d + . For rectangles, this contrasts with the currently best known approximation factor of

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: José R. Correa, Claire Kenyon
• Keywords: Algorithms, Minimum Number, Polynomial Time Approximation Scheme, SODA 2004, Unit Cubes