Abstract
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.
Cite
CITATION STYLE
Ahn, H. K., Kim, S. S., Knauer, C., Schlipf, L., Shin, C. S., & Vigneron, A. (2011). Covering and piercing disks with two centers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7074 LNCS, pp. 50–59). https://doi.org/10.1007/978-3-642-25591-5_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
