Online unit clustering: Variations on a theme

Leah Epstein; Asaf Levin; Rob van Stee

doi:10.1016/j.tcs.2008.04.046

Online unit clustering: Variations on a theme

Leah Epstein, Asaf Levin, Rob van Stee

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	85-96
Number of pages	12
Journal	Theoretical Computer Science
Volume	407
Issue number	1-3
DOIs	https://doi.org/10.1016/j.tcs.2008.04.046
State	Published - 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
General Computer Science

Access to Document

10.1016/j.tcs.2008.04.046

Cite this

@article{cd5e5f67ae7e4019b9dd9aeb8fb1f49c,

title = "Online unit clustering: Variations on a theme",

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.",

keywords = "Clustering, Coloring, Online algorithms",

author = "Leah Epstein and Asaf Levin and {van Stee}, Rob",

note = "Funding Information: The third author{\textquoteright}s research was supported by the German Research Foundation (DFG). Work performed while this author was at the University of Karlsruhe, Germany.",

year = "2008",

month = nov,

day = "6",

doi = "10.1016/j.tcs.2008.04.046",

language = "English",

volume = "407",

pages = "85--96",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Online unit clustering

T2 - Variations on a theme

AU - Epstein, Leah

AU - Levin, Asaf

AU - van Stee, Rob

N1 - 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.

PY - 2008/11/6

Y1 - 2008/11/6

N2 - 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.

AB - 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.

KW - Clustering

KW - Coloring

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=53349175672&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.04.046

DO - 10.1016/j.tcs.2008.04.046

M3 - Article

AN - SCOPUS:53349175672

SN - 0304-3975

VL - 407

SP - 85

EP - 96

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

Online unit clustering: Variations on a theme

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this