On strip packing With rotations

We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a rectangle (strip) of fixed width and minimum height, and these rectangles can be rotated by 90◦ . Additionally, we present a simple asymptotic polynomial time approximation scheme, and give an improved algorithm for two-dimensional bin packing with rotations. Categories and Subject Descriptors F.2 [Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems General Terms Algorithms Keywords strip packing, rotations, approximation scheme

• Type: Conference
• Year: 2005
• Where: STOC
• Authors: Klaus Jansen, Rob van Stee
• Keywords: Algorithms, Fully Polynomial Time Approximation Scheme, Polynomial Time Approximation Scheme, STOC 2005, Two-dimensional Strip Packing