Approximation algorithms for array partitioning problems

S. Muthukrishnan, Torsten Suel

    Research output: Contribution to journalArticlepeer-review


    We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into p (respectively, q) intervals, resulting in p × q rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP-complete problems that improve significantly over previously known bounds. The algorithms are fast and simple, work for a variety of measures of partitioning quality, generalize to dimensions d > 2, and achieve almost optimal approximation ratios. We also extend previous NP-completeness results for this class of problems.

    Original languageEnglish (US)
    Pages (from-to)85-104
    Number of pages20
    JournalJournal of Algorithms
    Issue number1
    StatePublished - Jan 2005

    ASJC Scopus subject areas

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


    Dive into the research topics of 'Approximation algorithms for array partitioning problems'. Together they form a unique fingerprint.

    Cite this