Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs

@article{Even2008AlgorithmsFC,
  title={Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs},
  author={Guy Even and Retsef Levi and Dror Rawitz and Baruch Schieber and Shimon Shahar and Maxim Sviridenko},
  journal={ACM Trans. Algorithms},
  year={2008},
  volume={4},
  pages={34:1-34:17}
}
In the rectangle stabbing problem, we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all the rectangles. In this article, we study the capacitated version of this problem in which the input includes an integral capacity for each line. The capacity of a line bounds the number of rectangles that the line can cover. We consider two versions of this problem. In the first, one is allowed to… CONTINUE READING