Resource augmentation in two-dimensional packing with orthogonal rotations

We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time algorithm for packing rectangles into at most OPT bins whose sides have length (1 + ), for any positive . Additionally, we show near-optimal packing results for a number of related packing problems.

• Type: Journal
• Year: 2006
• Where: ORL
• Authors: José R. Correa
• Keywords: Minimum Number, ORL 2006, Polynomial-time Algorithm, Two-dimensional Rectangles