Pages that link to "Item:Q680146"
From MaRDI portal
The following pages link to Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146):
Displayed 7 items.
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- Covering segments with unit squares (Q5894547) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)
- Covering a set of points with a minimum number of equal disks via simulated annealing (Q6097195) (← links)