The aligned K-center problem

Peter Braß, Christian Knauer, Hyeonsuk Na, Chansu Shin, Antoine E. Vigneron

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

In this paper we study several instances of the aligned k-center problem where the goal is, given a set of points S in the plane and a parameter k ≥ 1, to find k disks with centers on a line ℓ such that their union covers S and the maximum radius of the disks is minimized. This problem is a constrained version of the well-known k-center problem in which the centers are constrained to lie in a particular region such as a segment, a line, or a polygon. We first consider the simplest version of the problem where the line ℓ is given in advance; we can solve this problem in time O(n log2 n). In the case where only the direction of ℓ is fixed, we give an O(n2 log 2 n)-time algorithm. When ℓ is an arbitrary line, we give a randomized algorithm with expected running time O(n4 log2 n). Then we present (1+ε)-approximation algorithms for these three problems. When we denote T(k, ε) = (k/ε2+(k/ε) log k) log(1/ε), these algorithms run in O(n log k + T(k, ε)) time, O(n log k + T(k, ε)/ε) time, and O(n log k + T(k, ε)/ε2) time, respectively. For k = O(n1/3/log n), we also give randomized algorithms with expected running times O(n + (k/ε2) log(1/ε)), O(n+(k/ε3) log(1/ε)), and O(n + (k/ε4) log(1/ε)), respectively. © 2011 World Scientific Publishing Company.
Original languageEnglish (US)
Pages (from-to)157-178
Number of pages22
JournalInternational Journal of Computational Geometry & Applications
Volume21
Issue number02
DOIs
StatePublished - Nov 20 2011

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics
  • Geometry and Topology
  • Theoretical Computer Science
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The aligned K-center problem'. Together they form a unique fingerprint.

Cite this