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 +

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Minghui Jiang
• Keywords: Interior-disjoint Uniform Circles, IPL 2006, Maximum-radius Circle, NP-hard Problem