Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

Piotr Berman, Bhaskar DasGupta, Shanmugavelayutham Muthukrishnan, Suneeta Ramaswami

    Research output: Contribution to journalArticle

    Abstract

    We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of 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.

    Original languageEnglish (US)
    Pages (from-to)443-470
    Number of pages28
    JournalJournal of Algorithms
    Volume41
    Issue number2
    DOIs
    StatePublished - Jan 1 2001

    Fingerprint

    Packing Problem
    Approximation algorithms
    Tiling
    Rectangle
    Approximation Algorithms
    Efficient Algorithms
    Best Approximation

    ASJC Scopus subject areas

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics

    Cite this

    Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. / Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, Shanmugavelayutham; Ramaswami, Suneeta.

    In: Journal of Algorithms, Vol. 41, No. 2, 01.01.2001, p. 443-470.

    Research output: Contribution to journalArticle

    Berman, P, DasGupta, B, Muthukrishnan, S & Ramaswami, S 2001, 'Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles', Journal of Algorithms, vol. 41, no. 2, pp. 443-470. https://doi.org/10.1006/jagm.2001.1188
    Berman, Piotr ; DasGupta, Bhaskar ; Muthukrishnan, Shanmugavelayutham ; Ramaswami, Suneeta. / Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. In: Journal of Algorithms. 2001 ; Vol. 41, No. 2. pp. 443-470.
    @article{7f71eeb56b8f478597cea2ee30118e9f,
    title = "Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles",
    abstract = "We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of 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.",
    author = "Piotr Berman and Bhaskar DasGupta and Shanmugavelayutham Muthukrishnan and Suneeta Ramaswami",
    year = "2001",
    month = "1",
    day = "1",
    doi = "10.1006/jagm.2001.1188",
    language = "English (US)",
    volume = "41",
    pages = "443--470",
    journal = "Journal of Algorithms",
    issn = "0196-6774",
    publisher = "Academic Press Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

    AU - Berman, Piotr

    AU - DasGupta, Bhaskar

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Ramaswami, Suneeta

    PY - 2001/1/1

    Y1 - 2001/1/1

    N2 - We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of 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.

    AB - We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of 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.

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

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

    U2 - 10.1006/jagm.2001.1188

    DO - 10.1006/jagm.2001.1188

    M3 - Article

    AN - SCOPUS:0037866149

    VL - 41

    SP - 443

    EP - 470

    JO - Journal of Algorithms

    JF - Journal of Algorithms

    SN - 0196-6774

    IS - 2

    ER -