Sciweavers

Share
JCO
2010

Polynomial time approximation schemes for minimum disk cover problems

8 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subset of points in P, to compute a subset of disks with minimum cardinality covering P. This problem is known to be NP-hard and an algorithm which approximates the optimal disk cover within a factor of (1 + ) in O(mn O( 1 2 log2 1 ) ) time is proposed in this paper. This work presents the first polynomial time approximation scheme for the minimum disk cover problem where the best known algorithm can approximate the optimal solution with a large constant factor. Further, several variants of the minimum disk cover problem such as the incongruent disk cover problem and the weighted disk cover problem are considered and approximation schemes are designed. Keywords Minimum disk cover · Polynomial time approximation scheme · Wireless network · Minimum weight disk cover
Chen Liao, Shiyan Hu
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JCO
Authors Chen Liao, Shiyan Hu
Comments (0)
books