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

    31 Citations (Scopus)

    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 - 2001
    Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
    Duration: Apr 30 2001May 1 2001

    Other

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

    Fingerprint

    Approximation algorithms
    Tiling
    Rectangle
    Packing
    Approximation Algorithms
    Packing Problem
    Best Approximation

    All Science Journal Classification (ASJC) codes

    • 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)
    Berman, Piotr ; Dasgupta, Bhaskar ; Muthukrishnan, S. ; Ramaswami, Suneeta. / Improved approximation algorithms for rectangle tiling and packing. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. pp. 427-436
    @inproceedings{bf583a836c0640de8c33635e8a956295,
    title = "Improved approximation algorithms for rectangle tiling and packing",
    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.",
    author = "Piotr Berman and Bhaskar Dasgupta and S. Muthukrishnan and Suneeta Ramaswami",
    year = "2001",
    language = "English (US)",
    isbn = "0898714907",
    pages = "427--436",
    booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

    }

    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, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.

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

    Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 427-436.

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

    TY - GEN

    T1 - Improved approximation algorithms for rectangle tiling and packing

    AU - Berman, Piotr

    AU - Dasgupta, Bhaskar

    AU - Muthukrishnan, S.

    AU - Ramaswami, Suneeta

    PY - 2001

    Y1 - 2001

    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.

    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

    SP - 427

    EP - 436

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

    ER -

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