Sciweavers

IPL
2006

A new approximation algorithm for labeling points with circle pairs

13 years 3 months ago
A new approximation algorithm for labeling points with circle pairs
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such that each site touches two circles and the circle radius is maximized. We present a new approximation algorithm for this problem that runs in O(nlogn + nlog 1 ) time and O(n) space and achieves an approximation factor of (2 + 3 + 2 4 + 3)/(4 +
Minghui Jiang
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Minghui Jiang
Comments (0)