On the online unit clustering problem

Leah Epstein, Rob Van Stee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh (Proc. Workshop on Approximation and Online Algorithms 2006, LNCS 4368, p.121-131. Springer, 2006). We design a deterministic algorithm with a competitive ratio of 7/4 for the one-dimensional case. This is the first deterministic algorithm that beats the bound of 2. It also has a better competitive ratio than the previous randomized algorithm. Moreover, we provide the first non-trivial deterministic lower bound, improve the randomized lower bound, and prove the first lower bounds for higher dimensions.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
Number of pages14
StatePublished - 2008
Event5th International Workshop on Approximation and Online Algorithms, WAOA 2007 - Eilat, Israel
Duration: 11 Oct 200712 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4927 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Approximation and Online Algorithms, WAOA 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On the online unit clustering problem'. Together they form a unique fingerprint.

Cite this