Abstract
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 space input size rather than in the domain size. In addition, we improve the best known approximation ratios, in some cases quite significantly.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms |
| Pages | 427-436 |
| Number of pages | 10 |
| State | Published - 2001 |
| Event | 2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001 |
Other
| Other | 2001 Operating Section Proceedings, American Gas Association |
|---|---|
| Country/Territory | United States |
| City | Dallas, TX |
| Period | 4/30/01 → 5/1/01 |
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics