Online conflict-free colorings for hypergraphs

Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky

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

9 Scopus citations


We provide a framework for online conflict-free coloring (CFcoloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high probability. As a corollary, we obtain asymptotically optimal randomized algorithms for online CF-coloring some hypergraphs that arise in geometry. Our algorithm uses exponentially fewer random bits compared to previous results. We introduce deterministic online CF-coloring algorithms for points on the line with respect to intervals and for points on the plane with respect to halfplanes (or unit discs) that use ⊖(logn) colors and recolor O(n) points in total.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540734198, 9783540734192
StatePublished - 1 Jan 2007
Externally publishedYes
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007

Publication series

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


Conference34th International Colloquium on Automata, Languages and Programming, ICALP 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Online conflict-free colorings for hypergraphs'. Together they form a unique fingerprint.

Cite this