Back to Search
Start Over
APPROXIMATION ALGORITHMS FOR RECTANGLE STABBING AND INTERVAL STABBING PROBLEMS.
- Source :
-
SIAM Journal on Discrete Mathematics . 2006, Vol. 20 Issue 3, p748-768. 21p. 4 Diagrams, 1 Chart. - Publication Year :
- 2006
-
Abstract
- In the weighted rectangle stabbing problem we are given a grid in ℝ² consisting 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 being that each rectangle is intersected by at least one column or 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 special case of this problem, called the interval stabbing problem, arises when each rectangle is intersected by exactly one row. We describe an algorithm called STAB, which is shown to be a constant-factor approximation algorithm for different variants of this stabbing problem. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 20
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 24789310
- Full Text :
- https://doi.org/10.1137/S089548010444273X