Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of minimal height, respectively. All packings have to be non-overlapping and orthogonal, i.e., axisparallel. Our algorithm for strip packing has an absolute approximation

• Type: Conference
• Year: 2009
• Where: APPROX
• Authors: Rolf Harren, Rob van Stee
• Keywords: Algorithms, APPROX 2009, Strip Packing, Strip Packing Problem, Two-dimensional Bin Packing