Pages that link to "Item:Q3560062"
From MaRDI portal
The following pages link to AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062):
Displaying 16 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)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← 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)
- On the line-separable unit-disk coverage and related problems (Q6600812) (← links)
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)
