Abstract
We study an NP-complete geometric covering problem called d -Dimensional Rectangle Stabbing, where, given a set of axis-parallel d-dimensional hyperrectangles, a set of axis-parallel (d − 1)-dimensional hyperplanes and a positive integer k, the question is whether one can select at most k of the hyperplanes such that every hyperrectangle is intersected by at least one of these hyperplanes. This problem is well-studied from the approximation point of view, while its parameterized complexity remained unexplored so far. Here we show, by giving a nontrivial reduction from a problem called Multicolored Clique, that for d ≥ 3 the problem is W[1]-hard with respect to the parameter k. For the case d = 2, whose parameterized complexity is still open, we consider several natural restrictions and show them to be fixed-parameter tractable.
Supported by the DAAD-DST exchange program D/05/57666.
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.
References
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Even, G., Rawitz, D., Shahar, S.: Approximation algorithms for capacitated rectangle stabbing. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 18–29. Springer, Heidelberg (2006)
Fellows, M.R.: Personal communication (September 2007)
Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems (manuscript, 2007)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J. Algorithms 43(1), 138–152 (2002)
Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. The Computer Journal (2007), doi:10.1093/comjnl/bxm053
Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Appl. Math. 30, 29–42 (1991)
Kovaleva, S., Spieksma, F.C.R.: Approximation of a geometric set covering problem. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 493–501. Springer, Heidelberg (2001)
Kovaleva, S., Spieksma, F.C.R.: Approximation algorithms for rectangle stabbing and interval stabbing problems. SIAM J. Discrete Math. 20(3), 748–768 (2006)
Langerman, S., Morin, P.: Covering things with things. Discrete Comput. Geom. 33(4), 717–729 (2005)
Mecke, S., Schöbel, A., Wagner, D.: Station location – complexity and approximation. In: Proc. 5th ATMOS, IBFI Dagstuhl, Germany (2005)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dom, M., Sikdar, S. (2008). The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)