Pages that link to "Item:Q5300002"
From MaRDI portal
The following pages link to ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002):
Displaying 22 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← 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)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
- A constant-factor approximation for multi-covering with disks (Q5174484) (← 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)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Line segment disk cover (Q5919111) (← links)
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)
