Covering and piercing disks with two centers

Type
Conference Paper
Authors
Ahn, Heekap
Kim, Sangsub
Knauer, Christian
Schlipf, Lena
Shin, Chansu
Vigneron, Antoine E. cc
KAUST Department
Visual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Geometric Algorithms Group
Date
2011

Metadata
Show full item record
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
Springer Science + Business Media
Journal
Lecture Notes in Computer Science
Conference/Event name
22nd International Symposium on Algorithms and Computation, ISAAC 2011
ISBN
9783642255908
ISSN
03029743
DOI
10.1007/978-3-642-25591-5_7
Handle URI
http://hdl.handle.net/10754/564326
Collections
Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division