Show simple item record

dc.contributor.authorAhn, Heekap
dc.contributor.authorKim, Sangsub
dc.contributor.authorKnauer, Christian
dc.contributor.authorSchlipf, Lena
dc.contributor.authorShin, Chansu
dc.contributor.authorVigneron, Antoine E.
dc.date.accessioned2015-08-03T11:01:46Z
dc.date.available2015-08-03T11:01:46Z
dc.date.issued2013-04
dc.identifier.issn09257721
dc.identifier.doi10.1016/j.comgeo.2012.09.002
dc.identifier.urihttp://hdl.handle.net/10754/562693
dc.description.abstractWe 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. © 2012 Elsevier B.V.
dc.description.sponsorshipWork by Ahn was supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2010-0009857). Work by Schlipf was supported by the German Science Foundation (DFG) within the research training group 'Methods for Discrete Structures' (GRK 1408). Work by Shin was supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2011-0002827).
dc.publisherElsevier BV
dc.relation.urlhttp://arxiv.org/abs/arXiv:1201.1198v1
dc.subjectCovering
dc.subjectDisks
dc.subjectPiercing
dc.subjectTwo-center
dc.titleCovering and piercing disks with two centers
dc.typeArticle
dc.contributor.departmentVisual Computing Center (VCC)
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.contributor.departmentGeometric Algorithms Group
dc.identifier.journalComputational Geometry: Theory and Applications
dc.contributor.institutionDepartment of Computer Science and Engineering, POSTECH, Pohang, South Korea
dc.contributor.institutionInstitute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germany
dc.contributor.institutionInstitute of Computer Science, Freie Universität Berlin, Germany
dc.contributor.institutionDepartment of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, South Korea
dc.identifier.arxividarXiv:1201.1198
kaust.personVigneron, Antoine E.
dc.date.posted2012-01-05


This item appears in the following Collection(s)

Show simple item record