Packing Rectangles into 2OPT Bins Using Rotations

Authors:
Rolf Harren;Rob Stee
Affiliations:
Max-Planck Institute for Computer Science (MPII), , Saarbrücken, Germany D-66123;Max-Planck Institute for Computer Science (MPII), , Saarbrücken, Germany D-66123
Venue:
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Year:
2008

Citing 13
Cited 1

Packing squares into a square

Journal of Parallel and Distributed Computing
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Mathematics of Operations Research
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

Mathematics of Operations Research
On strip packing With rotations

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for multidimensional bin packing problems

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Maximizing the Total Profit of Rectangles Packed into a Rectangle

Algorithmica
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
Inapproximability results for orthogonal rectangle packing problems with rotations

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A 3-approximation algorithm for two-dimensional bin packing

Operations Research Letters
An approximation algorithm for square packing

Operations Research Letters
New approximability results for 2-dimensional packing problems

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Two for One: Tight Approximation of 2D Bin Packing

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles can be rotated by 90 degrees and have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided $\mathcal{P} \not= \mathcal{NP}$.