A 2(1/8)-Approximation Algorithm for Rectangle Tiling

@inproceedings{Paluch2004A2A,
  title={A 2(1/8)-Approximation Algorithm for Rectangle Tiling},
  author={Katarzyna E. Paluch},
  booktitle={ICALP},
  year={2004}
}
We study the following problem. Given an n×n array A of nonnegative numbers and a natural number p, partition it into at most p rectangular tiles, so that the maximal weight of a tile is minimized. A tile is any rectangular subarray of A. The weight of a tile is the sum of the elements that fall within it. In the partition the tiles must not overlap and are to cover the whole array. We give a 2 8−approximation algorithm, which is tight with regard to the only known and used lower bound… CONTINUE READING
3 Citations
10 References
Similar Papers

Similar Papers

Loading similar papers…