Pages that link to "Item:Q5757391"
From MaRDI portal
The following pages link to Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391):
Displaying 13 items.
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Guarding 1.5D terrains with demands (Q4902836) (← links)
- (Q5091054) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)