Amortized efficiency of list update and paging rules
Communications of the ACM
An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Online computation and competitive analysis
Online computation and competitive analysis
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-Line Routing in All-Optical Networks
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Randomized online graph coloring
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Coloring inductive graphs on-line
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Theoretical Computer Science
| Hi-index | 0.00 |
We study the power of randomization in the design of on-line graph coloring algorithms. No specific network topology for which randomized online algorithms perform substantially better than deterministic algorithms is known until now. We present randomized lower bounds for online coloring of some well studied network topologies. We show that no randomized algorithm for online coloring of interval graphs achieves a competitive ratio strictly better than the best known deterministic algorithm [KT81]. We also present a first lower bound on the competitive ratio of randomized algorithms for path coloring on tree networks, then answering an open question posed in [BEY98]. We prove an Ω(log Δ) lower bound for trees of diameter Δ = O(log n) that compares with the known O(Δ)- competitive deterministic algorithm for the problem, then still leaving open the question if randomization helps for this specific topology.