Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

  title={Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity},
  author={Timothy M. Chan and Thomas C. van Dijk and Krzysztof Fleszar and J. Spoerhase and A. Wolff},
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every rectangle is stabbed by some line segment. A line segment stabs a rectangle if it intersects its left and its right boundary. The problem, which we call Stabbing, can be motivated by a resource allocation problem and has applications in geometric network design… Expand
A QPTAS for stabbing rectangles
This work presents a quasipolynomial time approximation scheme (QPTAS) for rectangle stabbing, and provides a simple 8-approximation algorithm that avoids the framework of Varadarajan. Expand
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems
The rounding technique is based on a generalization of the threshold rounding idea used by Kovaleva and Spieksma, which may prove useful for rounding the LP relaxations of other geometric covering problems. Expand
Fast LP-based Approximations for Geometric Packing and Covering Problems
This work derives fast approximation schemes for LP relaxations of several well-studied geometric optimization problems that include packing, covering, and mixed packing and covering constraints and obtains the first near-linear constant factor approximation algorithms for several problems. Expand


Exact algorithms and APX-hardness results for geometric packing and covering problems
It is APX-hard to compute a minimum cover of a set of points in the plane by a family of axis-aligned fat rectangles, even when each rectangle is an @e-perturbed copy of a single unit square. Expand
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
This article studies the capacitated version of the rectangle stabbing problem in which the input includes an integral capacity for each line, and presents an exact polynomial-time algorithm for the weighted one dimensional case with hard capacities that can be extended to the one dimensional weighted case with soft capacities. Expand
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
This work provides constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem, and extends the results to the d-dimensional space for d?2, where a d-approximation algorithm for the stabbed problem and a dd-app approximation algorithms for the partitioning Problem are developed. Expand
Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
An algorithm called STAB is described, which is shown to be a constant-factor approximation algorithm for different variants of this stabbing problem. Expand
Approximating the Generalized Minimum Manhattan Network Problem
The solution is based on a stabbing technique, a novel way of attacking Manhattan network problems, and it is shown that an existing existing O(logn)-approximation algorithm for 2D-RSA generalizes to higher dimensions. Expand
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
This work provides a geometry-inspired algorithm whose approximation guarantee depends solely on an instance-specific combinatorial property known as shallow cell complexity (SCC), and settles an open question by showing that weighted instances of the capacitated covering problem with underlying network structure have O(1)-approximations. Expand
Improved Results on Geometric Hitting Set Problems
This work gives the first PTAS for this problem when the geometric objects are half-spaces in ℝ3 and when they are an r-admissible set regions in the plane (this includes pseudo-disks as they are 2- admissible). Expand
Small-size ε-nets for axis-parallel rectangles and boxes
Improved approximation factors are obtained for the hitting set or the set cover problems associated with the corresponding range spaces for ε-nets of size O(1/ε log log log 1/ε) for planar point sets and axis-parallel rectangular ranges. Expand
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Even for the unweighted case, a polynomial time approximation scheme (PTAS) for a fundamental class of objects called pseudodisks (which includes halfspaces, disks, unit-height rectangles, translates of convex sets, etc.) is curren... Expand
Almost optimal set covers in finite VC-dimension
We give a deterministic polynomial-time method for finding a set cover in a set system (X, ℛ) of dual VC-dimensiond such that the size of our cover is at most a factor ofO(d log(dc)) from the optimalExpand