We give exact and approximation algorithms for two-center problems when the input is a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in D intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks. © 2012 Elsevier B.V.
ASJC Scopus subject areas
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics
- Geometry and Topology
- Computer Science Applications