Abstract
The weighted rectangle multi-stabbing problem (WRMS) can be described as follows: given is a grid in \(\mathop{I\!\!R}^2\)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 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.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Gaur, D., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms 43, 138–152 (2002)
Hassin, R., Megiddo, N.: Approximation algorithm for hitting objects with straight lines. Discrete Applied Mathematics 30, 29–42 (1991)
Kovaleva, S.: Approximation of Geometric Set Packing and Hitting Set Problems, Ph.D. thesis of Maastricht University (2003)
Kovaleva, S., Spieksma, F.C.R.: Primal-dual approximation algorithms for a packing-covering pair of problems. RAIRO-Operations Research 36, 53–72 (2002)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovaleva, S., Spieksma, F.C.R. (2004). Approximation of Rectangle Stabbing and Interval Stabbing Problems. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive