scientific article; zbMATH DE number 7561415
From MaRDI portal
Publication:5091054
DOI10.4230/LIPIcs.ISAAC.2018.61MaRDI QIDQ5091054
Joachim Spoerhase, Timothy M. Chan, Krzysztof Fleszar, Thomas C. van Dijk, Alexander Wolff
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1806.02851
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
A PTAS for the horizontal rectangle stabbing problem ⋮ Geometric stabbing via threshold rounding and factor revealing LPs ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
Cites Work
- Unnamed Item
- Fixed-parameter tractability and lower bounds for stabbing problems
- 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
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- A threshold of ln n for approximating set cover
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- The Geometry of Scheduling
- Analytical approach to parallel repetition
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
This page was built for publication:
