Constant approximation algorithms for rectangle stabbing and related problems
From MaRDI portal
Recommendations
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- scientific article; zbMATH DE number 1670660
- The parameterized complexity of stabbing rectangles
Cited in
(17)- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time
- A PTAS for the horizontal rectangle stabbing problem
- The parameterized complexity of stabbing rectangles
- scientific article; zbMATH DE number 1670660 (Why is no real title available?)
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Approximation Algorithms for Capacitated Rectangle Stabbing
- Fixed-parameter tractability and lower bounds for stabbing problems
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Partial multicovering and the d-consecutive ones property
- scientific article; zbMATH DE number 842885 (Why is no real title available?)
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- Stabbing rectangles by line segments -- how decomposition reduces the shallow-cell complexity
- Algorithms – ESA 2004
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
- Geometric stabbing via threshold rounding and factor revealing LPs
- Algorithms for high dimensional stabbing problems
This page was built for publication: Constant approximation algorithms for rectangle stabbing and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866919)
