### Abstract

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 this problem is NP-hard to approximate. In this paper we give a simple algorithm that improves the best previously known approximation factor from to 2/3. The main steps of our algorithm are as follows. We first compute the Voronoi diagram, then label each point optimally within its cell, compute the smallest label diameter over all points and finally shrink all labels to this size. We keep the O(n log n) time and O(n) space bounds of the previously best algorithm.

Original language | English |
---|---|

Pages (from-to) | 269-282 |

Journal | International Journal of Computational Geometry and Applications |

Volume | 12 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2002 |

## Fingerprint Dive into the research topics of 'A simple factor-2/3 approximation algorithm for two-circle point labeling'. Together they form a unique fingerprint.

## Cite this

Wolff, A., Thon, M., & Xu, Y. F. (2002). A simple factor-2/3 approximation algorithm for two-circle point labeling.

*International Journal of Computational Geometry and Applications*,*12*(4), 269-282. https://doi.org/10.1142/S0218195902000888