Pages that link to "Item:Q1748995"
From MaRDI portal
The following pages link to Near-linear time approximation schemes for geometric maximum coverage (Q1748995):
Displaying 8 items.
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)
- Energy-constrained geometric coverage problem (Q6167018) (← links)
- Approximation algorithms for finding maximum containing circle and sphere (Q6652433) (← links)