Location of Repository

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity tree is given. If the connectivity tree is unknown, the problem is NP-hard if there are upper bounds on the radii and open otherwise. We give approximation guarantees for a variety of polynomial-time algorithms, describe upper and lower bounds (which are matching in some of the cases), provide polynomial-time approximation schemes, and conclude with experimental results and open problems.Comment: 21 pages, 15 figures, full version of extended abstract that appeared in Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011

Topics:
Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms, F.2.2

Year: 2016

OAI identifier:
oai:arXiv.org:1105.0791

Provided by:
arXiv.org e-Print Archive

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.