Approximation algorithms for array partitioning problems

@article{Muthukrishnan2005ApproximationAF,
  title={Approximation algorithms for array partitioning problems},
  author={S. Muthukrishnan and Torsten Suel},
  journal={J. Algorithms},
  year={2005},
  volume={54},
  pages={85-104}
}
We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into (resp., ) intervals, resulting in 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… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
26 Citations
30 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Similar Papers

Loading similar papers…