The following pages link to Unit disk cover problem in 2D (Q491638):
Displaying 12 items.
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Discretely Following a Curve (Q2867104) (← links)
- Discrete unit square cover problem (Q4644781) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Line segment disk cover (Q5919111) (← links)
- A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)
