Pages that link to "Item:Q3652190"
From MaRDI portal
The following pages link to Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190):
Displaying 9 items.
- Unit disk cover problem in 2D (Q491638) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
- Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)