A PTAS for the horizontal rectangle stabbing problem
From MaRDI portal
Publication:2164717
DOI10.1007/978-3-031-06901-7_27zbMath1497.90176arXiv2111.05197OpenAlexW3214707727MaRDI QIDQ2164717
Aditya Subramanian, Andreas Wiese, Arindam Khan
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2111.05197
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Approximating the generalized minimum Manhattan network problem
- Almost optimal set covers in finite VC-dimension
- Batch processing with interval graph compatibilities between tasks
- Weighted geometric set cover via quasi-uniform sampling
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Approximation schemes for covering and packing problems in image processing and VLSI
- A Greedy Heuristic for the Set-Covering Problem
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
- On Guillotine Separability of Squares and Rectangles.
This page was built for publication: A PTAS for the horizontal rectangle stabbing problem
