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):
Displaying 19 items.
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- Approximation algorithms for the class cover problem (Q1430285) (← links)
- Two optimization problems for unit disks (Q1615636) (← 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)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- A constant-factor approximation for multi-covering with disks (Q5174484) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)
- Covering segments with unit squares (Q5894547) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← 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)
