Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

APPROX
2009
Springer

favoriteEmaildiscussreport

177views Algorithms» more APPROX 2009»

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

14 years 5 months ago

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

Download www.mpi-inf.mpg.de

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

Real-time Traffic

Algorithms | APPROX 2009 | Strip Packing | Strip Packing Problem | Two-dimensional Bin Packing |

claim paper

Related Content

» Maximizing the Number of Packed Rectangles

» A Polynomial Time Approximation Scheme for the Square Packing Problem

» An Improved Randomized Approximation Algorithm for Maximum Triangle Packing

» Approximation Algorithms for 3D Orthogonal Knapsack

» Bin Packing with Rejection Revisited

» Solving Packing Problem with Weaker Block Solvers

» Improved approximation algorithms for rectangle tiling and packing

» Greedy Approximation via Duality for Packing Combinatorial Auctions and Routing

» Two for One Tight Approximation of 2D Bin Packing

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Rolf Harren, Rob van Stee

Comments (0)