KAUST DepartmentVisual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Geometric Algorithms Group
Permanent link to this recordhttp://hdl.handle.net/10754/564326
MetadataShow full item record
AbstractWe 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.
Conference/Event name22nd International Symposium on Algorithms and Computation, ISAAC 2011