Pages that link to "Item:Q839638"
From MaRDI portal
The following pages link to Covering many or few points with unit disks (Q839638):
Displaying 18 items.
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- How many intervals cover a point in Dvoretzky covering? (Q1852719) (← links)
- Fuzzy disk for covering fuzzy points (Q1887918) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- On isolating points using unit disks (Q2970462) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- On Isolating Points Using Disks (Q3092217) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Faster algorithms for some optimization problems on collinear points (Q5115775) (← links)
- A novel approximation algorithm for max-covering circle problem (Q6606184) (← links)
- The line-constrained maximum coverage facility location problem (Q6606204) (← links)
- Approximation algorithms for finding maximum containing circle and sphere (Q6652433) (← links)