Online unit clustering: Variations on a theme

Leah Epstein, Asaf Levin, Rob van Stee

Research output: Contribution to journalArticlepeer-review

Abstract

Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We study several variants and generalizations of the online unit clustering problem, which are inspired by variants of packing and scheduling problems in the literature.

Original languageEnglish
Pages (from-to)85-96
Number of pages12
JournalTheoretical Computer Science
Volume407
Issue number1-3
DOIs
StatePublished - 6 Nov 2008

Bibliographical note

Funding Information:
The third author’s research was supported by the German Research Foundation (DFG). Work performed while this author was at the University of Karlsruhe, Germany.

Keywords

  • Clustering
  • Coloring
  • Online algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Online unit clustering: Variations on a theme'. Together they form a unique fingerprint.

Cite this