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.

• Type: Conference
• Year: 2001
• Where: SODA
• Authors: Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
• Keywords: Algorithms, Approximation Algorithms, Rectangle Tiling, SODA 2001, Sparse Input Size