Improved approximation algorithms for rectangle tiling and packing

Piotr Berman, Bhaskar Dasgupta, S. Muthukrishnan, Suneeta Ramaswami

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish (US)
    Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
    Pages427-436
    Number of pages10
    StatePublished - Dec 1 2001
    Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
    Duration: Apr 30 2001May 1 2001

    Publication series

    NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

    Other

    Other2001 Operating Section Proceedings, American Gas Association
    CountryUnited States
    CityDallas, TX
    Period4/30/015/1/01

      Fingerprint

    Keywords

    • Algorithms
    • Design
    • Measurement
    • Performance
    • Theory
    • Verification

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Berman, P., Dasgupta, B., Muthukrishnan, S., & Ramaswami, S. (2001). Improved approximation algorithms for rectangle tiling and packing. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 427-436). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).