# A QPTAS for stabbing rectangles

@article{Eisenbrand2021AQF, title={A QPTAS for stabbing rectangles}, author={Friedrich Eisenbrand and Martina Gallato and Ola Svensson and Moritz Venzin}, journal={ArXiv}, year={2021}, volume={abs/2107.06571} }

We consider the following geometric optimization problem: Given n axis-aligned rectangles in the plane, the goal is to nd a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a rectangle if it intersects both its le and right edge. As such, this stabbing problem falls into the category of weighted geometric set cover problems for which techniques that improve upon the general Θ(log n)-approximation guarantee have received a lot of aention… Expand

#### References

SHOWING 1-10 OF 21 REFERENCES

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

- Mathematics, Computer Science
- ISAAC
- 2018

The decomposition technique yields constant-factor approximations also for the variant where rectangles can be stabbed by horizontal and vertical segments and for two further geometric set cover problems. Expand

Exact algorithms and APX-hardness results for geometric packing and covering problems

- Computer Science, Mathematics
- Comput. Geom.
- 2014

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

Approximation Schemes for Maximum Weight Independent Set of Rectangles

- Computer Science, Mathematics
- 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
- 2013

This work presents the first (1 + ε)-approximation algorithm for the MWISR problem with quasipolynomial running time 2poly(log n/ε) and presents a new geometric dynamic program which recursively subdivides the plane into polygons of bounded complexity. Expand

Settling the APX-Hardness Status for Geometric Set Cover

- Mathematics, Computer Science
- 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- 2014

A QPTAS is presented for all natural geometric set-cover problems, based on the separator framework of Adamaszek and Wiese (FOCS 2013, SODA 2014), which rules out the possibility that these problems are APX-hard, assuming NP DTIME(2polylog(n). Expand

Improved Results on Geometric Hitting Set Problems

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2010

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

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling

- Computer Science, Mathematics
- SODA
- 2012

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

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces

- Computer Science, Mathematics
- SIAM J. Comput.
- 2015

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

Improved approximation algorithms for geometric set cover

- Mathematics, Computer Science
- SCG
- 2005

It is shown that polynomial time approximation algorithms with provable performance exist, under a certain general condition: that for a random subset R ⊂ S and function f(), there is a decomposition of the complement U ∖ ∪Y ∈ R Y into an expected f(|R|) regions. Expand

Approximation Schemes for Independent Set and Sparse Subsets of Polygons

- Computer Science, Mathematics
- J. ACM
- 2019

Surprisingly, the (1+ε)-approximation algorithm can be extended to the problem of computing the maximum cardinality subset of the given set of polygons whose intersection graph fulfills some sparsity condition, and it is shown that one can approximate the maximum subset of polygon such that the intersection graph of the subset is planar or does not contain a cycle of length 4. Expand

Almost optimal set covers in finite VC-dimension

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1995

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 optimal… Expand