An improved algorithm for online unit clustering

Hamid Zarrabi-Zadeh, Timothy M. Chan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to partition the points into a minimum number of subsets, each enclosable by a unit interval. We present a new randomized online algorithm that achieves expected competitive ratio 11/6 against oblivious adversaries, improving the previous ratio of 15/8. This immediately leads to improved upper bounds for the problem in two and higher dimensions as well.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings
PublisherSpringer-Verlag Berlin Heidelberg
Pages383-393
Number of pages11
ISBN (Print)9783540735441
DOIs
StatePublished - 2007
Externally publishedYes
Event13th Annual International Computing and Combinatorics Conference, COCOON 2007 - Banff, Canada
Duration: Jul 16 2007Jul 19 2007

Publication series

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

Other

Other13th Annual International Computing and Combinatorics Conference, COCOON 2007
CountryCanada
CityBanff
Period7/16/077/19/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An improved algorithm for online unit clustering'. Together they form a unique fingerprint.

Cite this