Sciweavers

SODA
2001
ACM

Improved approximation algorithms for rectangle tiling and packing

14 years 26 days ago
Improved approximation algorithms for rectangle tiling and packing
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In addition, we improve the best known approximation ratios, in some cases quite significantly.
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan,
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where SODA
Authors Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
Comments (0)