Sciweavers

Share
ISAAC
2009
Springer

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm

10 years 4 days ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and the best previous practical solution is a 38-approximation algorithm by Carmi et al. [4]. We first consider the line-separable discrete unit disk cover problem (the set of disk centres can be separated from the set of points by a line) for which we present an O(m2 n)-time algorithm that finds an exact solution. Combining our line-separable algorithm with techniques from the algorithm of Carmi et al. [4] results in an O(m2 n4 ) time 22-approximate solution to the discrete unit disk cover problem.
Francisco Claude, Reza Dorrigiv, Stephane Durocher
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
Comments (0)
books