File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Covering and piercing disks with two centers
- Author(s)
- Ahn, Hee-Kap, Kim, Sang-Sub, Knauer, Christian, Schlipf, Lena, Shin, Chan-Su, Vigneron, Antoine
- Issued Date
- 2011-12-06
- Fulltext
- http://www.is.titech.ac.jp/isaac11/
- Citation
- ISAAC 2011 (The 22nd International Symposium on Algorithms and Computation), pp.50 - 59
- 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.
- Publisher
- ISAAC 2011
- ISSN
- 0302-9743
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.