The Parameterized Complexity of Stabbing Rectangles
- 163 Downloads
The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set R of axis-parallel rectangles in the plane, a set L of horizontal and vertical lines in the plane, and a positive integer k, select at most k of the lines such that every rectangle is intersected by at least one of the selected lines.
While it is known that the problem can be approximated in polynomial time within a factor of two, its parameterized complexity with respect to the parameter k was open so far. Giving two fixed-parameter reductions, one from the W-complete problem Multicolored Clique and one to the W-complete problem Short Turing Machine Acceptance, we prove that Rectangle Stabbing is W-complete with respect to the parameter k, which in particular means that there is no hope for an algorithm running in f(k)⋅|R∪L| O(1) time. Our reductions also show the W-completeness of the more general problem Set Cover on instances that “almost have the consecutive-ones property”, that is, on instances whose matrix representation has at most two blocks of 1s per row.
We also show that the special case of Rectangle Stabbing where all rectangles are squares of the same size is W-hard. The case where the input consists of non-overlapping rectangles was open for some time and has recently been shown to be fixed-parameter tractable (Heggernes et al., Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing, 2009). By giving an algorithm running in (2k) k ⋅|R∪L| O(1) time, we show that Rectangle Stabbing is fixed-parameter tractable in the still NP-hard case where both these restrictions apply, that is, in the case of disjoint squares of the same size. This algorithm is faster than the one in Heggernes et al. (Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing, 2009) for the disjoint rectangles case. Moreover, we show fixed-parameter tractability for the restrictions where the rectangles have bounded width or height or where each horizontal line intersects only a bounded number of rectangles.
KeywordsParameterized complexity Fixed-parameter algorithms Geometric covering problems Whardness
Unable to display preview. Download preview PDF.
- 4.Bilò, V., Goyal, V., Ravi, R., Singh, M.: On the crossing spanning tree problem. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’04). LNCS, vol. 3122, pp. 51–60. Springer, Berlin (2004) Google Scholar
- 14.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006) Google Scholar
- 17.Giannopoulos, P., Knauer, C., Rote, G., Werner, D.: Fixed-parameter tractability and lower bounds for stabbing problems. In: Proceedings of the 25th European Workshop on Computational Geometry (EuroCG’09), pp. 281–284 (2009) Google Scholar
- 21.Heggernes, P., Kratsch, D., Lokshtanov, D., Raman, V., Saurabh, S.: Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Manuscript (2009) Google Scholar
- 24.Katz, M.J., Nielsen, F.: On piercing sets of objects. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG’96), pp. 113–121. ACM, New York (1996) Google Scholar
- 25.Koushanfar, F., Slijepcevic, S., Potkonjak, M., Sangiovanni-Vincentelli, A.: Error-tolerant multimodal sensor fusion. In: Proceedings of the IEEE CAS Workshop on Wireless Communications and Networking. IEEE CAS, Piscataway (2002) Google Scholar
- 26.Kovaleva, S., Spieksma, F.C.R.: Approximation of a geometric set covering problem. In: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC’01). LNCS, vol. 2223, pp. 493–501. Springer, Berlin (2001) Google Scholar
- 30.Mecke, S., Schöbel, A., Wagner, D.: Station location—complexity and approximation. In: Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS’05). IBFI Dagstuhl, Germany (2005) Google Scholar
- 36.Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SOCG’96), pp. 122–132. ACM, New York (1996) Google Scholar
- 38.Weis, S., Reischuk, R.: The complexity of physical mapping with strict chimerism. In: Proceedings of the 6th Annual International Computing and Combinatorics Conference (COCOON’00). LNCS, vol. 1858, pp. 383–395. Springer, Berlin (2000) Google Scholar