Sciweavers

Share
APPROX
2009
Springer

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

9 years 10 months ago
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
Rolf Harren, Rob van Stee
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where APPROX
Authors Rolf Harren, Rob van Stee
Comments (0)
books