Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

  • Authors:

  • Michael Dom;Michael R. Fellows;Frances A. Rosamond

  • Affiliations:

  • Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany D-07743;PC Research Unit, Office of DVC (Research), University of Newcastle, Callaghan, Australia NSW 2308;PC Research Unit, Office of DVC (Research), University of Newcastle, Callaghan, Australia NSW 2308

  • Venue:
  • WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set of horizontal and vertical lines in the plane, a set of rectangles 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 with a factor of two, its parameterized complexity with respect to the parameter k was open so far--only its generalization to three or more dimensions was known to be W[1]-hard. Giving two fixed-parameter reductions, one from the W[1]-complete problem Multicolored Clique and one to the W[1]-complete problem Short Turing Machine Acceptance , we prove that Rectangle Stabbing is W[1]-complete with respect to the parameter k , which in particular means that there is no hope for fixed-parameter tractability with respect to the parameter k . Our reductions show also the W[1]-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. For the special case of Rectangle Stabbing where all rectangles are squares of the same size we can also show W[1]-hardness, while the parameterized complexity of the special case where the input consists of rectangles that do not overlap is open. By giving an algorithm running in (4k + 1) k ·n O (1) time, we show that Rectangle Stabbing is fixed-parameter tractable in the still NP-hard case where both these restrictions apply.