Online coloring of hypergraphs

Authors:
Magnús M. Halldórsson
Affiliations:
School of Computer Science, Reykjavik University, 101 Reykjavik, Iceland
Venue:
Information Processing Letters
Year:
2010

Citing 5
Cited 0

Lower bounds for on-line graph coloring

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Parallel and on-line graph coloring

Journal of Algorithms
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Online hypergraph coloring

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a tight bound on randomized online coloring of hypergraphs. The bound holds even if the algorithm knows the hypergraph in advance (but not the ordering in which it is presented). More specifically, we show that for any n and k, there is a 2-colorable k-uniform hypergraph on n vertices for which any randomized online coloring uses @W(n/k) colors in expectation.