We consider new versions of the two-center problem where the input consists of a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks. We give exact and approximation algorithms for these versions. © 2011 Springer-Verlag.
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science