Type
Conference PaperKAUST Department
Visual Computing Center (VCC)Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Geometric Algorithms Group
Date
2011Permanent link to this record
http://hdl.handle.net/10754/564326
Metadata
Show full item recordAbstract
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.Citation
Ahn, H.-K., Kim, S.-S., Knauer, C., Schlipf, L., Shin, C.-S., & Vigneron, A. (2011). Covering and Piercing Disks with Two Centers. Lecture Notes in Computer Science, 50–59. doi:10.1007/978-3-642-25591-5_7Publisher
Springer NatureConference/Event name
22nd International Symposium on Algorithms and Computation, ISAAC 2011ISBN
9783642255908ae974a485f413a2113503eed53cd6c53
10.1007/978-3-642-25591-5_7