Name
Abstract | ||
|---|---|---|
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[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 an algorithm running in f(k)⋅|R∪L| O(1) time. Our reductions also show 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. We also show that the special case of Rectangle Stabbing where all rectangles are squares of the same size is W[1]-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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00453-010-9471-4 | Algorithmica |
Keywords | Field | DocType |
fixed-parameter tractable,general problem,complete problem,np-hard case,parameterized complexity,stabbing rectangles,rectangle stabbing,problem rectangle stabbing,cochromatic number,fixed-parameter algorithm,disjoint rectangles case,disjoint rectangle | Discrete mathematics,Combinatorics,Parameterized complexity,Disjoint sets,Largest empty rectangle,Rectangle,Time complexity,Mathematics,Bounded function,Computational complexity theory,Rectangle method | Journal |
Volume | Issue | ISSN |
62 | 1-2 | 1432-0541 |
Citations | PageRank | References |
1 | 0.35 | 30 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Dom | 1 | 301 | 16.11 |
| Michael R. Fellows | 2 | 4138 | 319.37 |
| Frances A. Rosamond | 3 | 21 | 2.83 |
| Somnath Sikdar | 4 | 420 | 25.31 |