Covering and piercing disks with two centers

Heekap Ahn, Sangsub Kim, Christian Knauer, Lena Schlipf, Chansu Shin, Antoine E. Vigneron

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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. © 2012 Elsevier B.V.
Original languageEnglish (US)
Pages (from-to)253-262
Number of pages10
JournalComputational Geometry: Theory and Applications
Issue number3
StatePublished - Apr 2013

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Geometry and Topology
  • Computer Science Applications


Dive into the research topics of 'Covering and piercing disks with two centers'. Together they form a unique fingerprint.

Cite this