Given a set P of n points in the plane, the two-circle point- labeling problem consists of placing 2n uniform, non-intersecting, maximum- size open circles such that each point touches exactly two circles.
It is known that it is NP-hard to approximate the label size beyond a factor of ˜ 0.7321. In this paper we improve the best previously known approximation factor from ˜ 0.51 to 2=3. We keep the O(n log n) time and O(n) space bounds of the previous algorithm.
As in the previous algorithm we label each point within its Voronoi cell. Unlike that algorithm we explicitely compute the Voronoi diagram, label each point optimally within its cell, compute the smallest label diameter over all points and finally shrink all labels to this size.
|Title of host publication||Algorithms and computation : proceedings 11th international symposium, ISAAC 2000, Taipei, Taiwan, december 18-20, 2000|
|Editors||D.T. Lee, S.H. Teng|
|Place of Publication||Berlin|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|