An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
Online computation and competitive analysis
Online computation and competitive analysis
Proceedings of the tenth annual ACM-SIAM symposium on Discrete 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
Developments from a June 1996 seminar on Online algorithms: the state of the art
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On-line coloring of h-free bipartite graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Online coloring of hypergraphs
Information Processing Letters
| Hi-index | 0.89 |
In this paper we investigate the online hypergraph coloring problem. In this online problem the algorithm receives the vertices of the hypergraph in some order v"1,...,v"n and it must color v"i by only looking at the subhypergraph H"i=(V"i,E"i) where V"i={v"1,...,v"i} and E"i contains the edges of the hypergraph which are subsets of V"i. We show that there exists no online hypergraph coloring algorithm with sublinear competitive ratio. Furthermore we investigate some particular classes of hypergraphs (k-uniform hypergraphs, hypergraphs with bounded matching number, projective planes), we analyse the online algorithm FF and give matching lower bounds for these classes.