Pages that link to "Item:Q613664"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for minimum disk cover problems (Q613664):
Displaying 14 items.
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Approximation algorithms for the class cover problem (Q1430285) (← links)
- A note on multicovering with disks (Q1931286) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- Polynomial time approximation schemes for base station coverage with minimum total radii (Q2484959) (← links)
- A constant-factor approximation for multi-covering with disks (Q2970422) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)