Covering and piercing disks with two centers

Handle URI:
http://hdl.handle.net/10754/564326
Title:
Covering and piercing disks with two centers
Authors:
Ahn, Heekap; Kim, Sangsub; Knauer, Christian; Schlipf, Lena; Shin, Chansu; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
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.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program; Geometric Algorithms Group
Publisher:
Springer Science + Business Media
Journal:
Lecture Notes in Computer Science
Conference/Event name:
22nd International Symposium on Algorithms and Computation, ISAAC 2011
Issue Date:
2011
DOI:
10.1007/978-3-642-25591-5_7
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642255908
Appears in Collections:
Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAhn, Heekapen
dc.contributor.authorKim, Sangsuben
dc.contributor.authorKnauer, Christianen
dc.contributor.authorSchlipf, Lenaen
dc.contributor.authorShin, Chansuen
dc.contributor.authorVigneron, Antoine E.en
dc.date.accessioned2015-08-04T06:23:47Zen
dc.date.available2015-08-04T06:23:47Zen
dc.date.issued2011en
dc.identifier.isbn9783642255908en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-25591-5_7en
dc.identifier.urihttp://hdl.handle.net/10754/564326en
dc.description.abstractWe 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.en
dc.publisherSpringer Science + Business Mediaen
dc.titleCovering and piercing disks with two centersen
dc.typeConference Paperen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.contributor.departmentGeometric Algorithms Groupen
dc.identifier.journalLecture Notes in Computer Scienceen
dc.conference.date5 December 2011 through 8 December 2011en
dc.conference.name22nd International Symposium on Algorithms and Computation, ISAAC 2011en
dc.conference.locationYokohamaen
dc.contributor.institutionDepartment of Computer Science and Engineering, POSTECH, Pohang, South Koreaen
dc.contributor.institutionInstitute of Computer Science, Universität Bayreuth, 95440 Bayreuth, Germanyen
dc.contributor.institutionInstitute of Computer Science, Freie Universität Berlin, Germanyen
dc.contributor.institutionDepartment of Digital and Information Engineering, Hankuk University of Foreign Studies, Yongin, South Koreaen
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.