| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438060 | Theoretical Computer Science | 2008 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
