Sciweavers

Share
WADS
2009
Springer

Two for One: Tight Approximation of 2D Bin Packing

11 years 11 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of 1× 1 bins without rotating the rectangles. We present a 2-approximate algorithm, which improves over the previous best known ratio of 3, matches the best results for the rotational case and also matches the known lower bound of approximability. Our approach makes strong use of a recently-discovered PTAS for a related knapsack problem and a new algorithm that can pack instances into OPT + 2 bins for any constant OPT.
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WADS
Authors Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
Comments (0)
books