Better Bounds on Online Unit Clustering

@inproceedings{Ehmsen2010BetterBO,
  title={Better Bounds on Online Unit Clustering},
  author={Martin R. Ehmsen and Kim S. Larsen},
  booktitle={SWAT},
  year={2010}
}
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. We continue work initiated by Chan and Zarrabi-Zadeh on determining the competitive ratio of the online version of this problem. For the one-dimensional case, we develop a deterministic algorithm, improving the best known upper bound of 7/4 by Epstein and van Stee to 5/3. This narrows the gap to the best known lower… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

Online unit clustering in higher dimensions

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An improved lower bound for one-dimensional online unit clustering

  • Theor. Comput. Sci.
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Online Clustering with Variable Sized Clusters

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Computational Geometry Column 68

  • SIGACT News
  • 2018
VIEW 1 EXCERPT
CITES METHODS

SIGACT News Online Algorithms Column 32: 2017 in review

  • SIGACT News
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Grid based online algorithms for clustering problems

  • 2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)
  • 2014
VIEW 1 EXCERPT
CITES METHODS