Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
SIAM Journal on Computing
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the Advice Complexity of Online Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Information complexity of online problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Advice complexity and barely random algorithms
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
In online graph coloring a graph is revealed to an online algorithm one vertex at a time, and the algorithm must color the vertices as they appear. This paper starts to investigate the advice complexity of this problem --- the amount of oracle information an online algorithm needs in order to make optimal choices. We also consider a more general problem --- a trade-off between online and offline graph coloring. In the paper we prove that precisely ⌈n/2 ⌉−1 bits of advice are needed when the vertices on a path are presented for coloring in arbitrary order. The same holds in the more general case when just a subset of the vertices is colored online. However, the problem turns out to be non-trivial for the case where the online algorithm is guaranteed that the vertices it receives form a subset of a path and are presented in the order in which they lie on the path. For this variant we prove that its advice complexity is βn+O(logn) bits, where β≈0.406 is a fixed constant (we give its closed form). This suggests that the generalized problem will be challenging for more complex graph classes.