Conference Paper

Approximation of Rectangle Stabbing and Interval Stabbing Problems.

DOI: 10.1007/978-3-540-30140-0_39 Conference: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings
Source: DBLP

ABSTRACT The weighted rectangle multi-stabbing problem (WRMS) can be described as follows: given is a grid in IR2\mathop{I\!\!R}^2consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having
a positive integral demand. The rectangles are placed arbitrarily in the grid with the only assumption that each rectangle
is intersected by at least one column and at least one row. The objective is to find a minimum weight (multi)set of columns
and rows of the grid so that for each rectangle the total multiplicity of selected columns and rows stabbing it is at least
its demand. (A column or row is said to stab a rectangle if it intersects it.)

0 Bookmarks
 · 
91 Views

Full-text (4 Sources)

View
61 Downloads
Available from
May 29, 2014