Covering and piercing disks with two centers
SCIE
SCOPUS
- Title
- Covering and piercing disks with two centers
- Authors
- Ahn, HK; Kim, SS; Knauer, C; Schlipf, L; Shin, CS; Vigneron, A
- Date Issued
- 2013-04
- Publisher
- ELSEVIER SCIENCE BV
- 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.
- Keywords
- Two-center; Covering; Piercing; Disks; PLANAR 2-CENTER; ALGORITHMS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15909
- DOI
- 10.1016/J.COMGEO.2012.09.002
- ISSN
- 0925-7721
- Article Type
- Article
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, vol. 46, no. 3, page. 253 - 262, 2013-04
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.