MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

2. Number - only D1

MPI-I-93-108

Static and dynamic algorithms for k-point clustering problems

Smid, Michiel and Datta, Amitava and Lenhof, Hans-Peter and Schwarz, Christian

February 1993, 20 pages.

.
Status: available - back from printing

Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified approach is given for solving the problem of finding a subset of $S$ of size $k$ that minimizes some closeness measure, such as the diameter, perimeter or the circumradius. Moreover, data structures are given that maintain such a subset under insertions and deletions of points.

URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-108

Hide details for BibTeXBibTeX
@TECHREPORT{SmidDattaLenhofSchwarz93,
  AUTHOR = {Smid, Michiel and Datta, Amitava and Lenhof, Hans-Peter and Schwarz, Christian},
  TITLE = {Static and dynamic algorithms for k-point clustering problems},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-108},
  MONTH = {February},
  YEAR = {1993},
  ISSN = {0946-011X},
}