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 kof 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.