| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415657 | Computational Geometry | 2013 | 10 Pages |
Abstract
We give exact and approximation algorithms for two-center problems when the input is a set DD of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in DD intersects one of these two disks. Then we study the problem of covering the set DD by two smallest congruent disks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron,