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
- 2013-04
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.46, no.3, pp.253 - 262
- Abstract
- We give exact and approximation algorithms for two-center problems when the input is a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in D intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks. (C) 2012 Elsevier B.V. All rights reserved
- Publisher
- ELSEVIER SCIENCE BV
- ISSN
- 0925-7721
- Keyword (Author)
- Two-center, Covering, Piercing, Disks
- Keyword
- PLANAR 2-CENTER, ALGORITHMS
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.