### 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 - Dec 1 2001 |

Event | 2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Other

Other | 2001 Operating Section Proceedings, American Gas Association |
---|---|

Country | United States |

City | Dallas, TX |

Period | 4/30/01 → 5/1/01 |

### Fingerprint

### Keywords

- Algorithms
- Design
- Measurement
- Performance
- Theory
- Verification

### ASJC Scopus subject areas

- Software
- Mathematics(all)

### Cite this

*Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 427-436). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

**Improved approximation algorithms for rectangle tiling and packing.** / Berman, Piotr; Dasgupta, Bhaskar; Muthukrishnan, Shanmugavelayutham; Ramaswami, Suneeta.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms.*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 427-436, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.

}

TY - GEN

T1 - Improved approximation algorithms for rectangle tiling and packing

AU - Berman, Piotr

AU - Dasgupta, Bhaskar

AU - Muthukrishnan, Shanmugavelayutham

AU - Ramaswami, Suneeta

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

KW - Algorithms

KW - Design

KW - Measurement

KW - Performance

KW - Theory

KW - Verification

UR - http://www.scopus.com/inward/record.url?scp=0003661392&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0003661392&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0003661392

SN - 0898714907

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 427

EP - 436

BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

ER -