Randomized lower bounds for online path coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 232-247

  Leonardi, Stefano ^a   Vitaletti, Andrea ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING; FORESTRY; GRAPH THEORY; RANDOM PROCESSES; TOPOLOGY; TREES (MATHEMATICS);

COMPETITIVE DETERMINISTIC ALGORITHMS; COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; GRAPH COLORINGS; NETWORK TOPOLOGY; ON-LINE ALGORITHMS; ON-LINE COLORING; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 84958605831     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_19     Document Type: Conference Paper

References (18)

1. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 31tth IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
2. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 412-423, 1994.
3. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
4. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
5. Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 531-540, 1996.
6. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 21tth International Colloqium on Automata, Languages and Programming, LNCS 1256, pages 516-526. Springer-Verlag, 1997.
7. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, NY, 1980.
8. O. Gerstel, G.H. Sasaki, and R. Ramaswami. Dynamic channel assignment for WDM optical networks with little or no wavelength conversion. In Proceedings of the 31tth Allerton Conference on Communication, Control, and Computing, 1996.
9. M.M. Halldörsson and M. Szegedi. Lower bounds for on-line graph coloring. In Proc. of 2th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 211-216, 1992.
10. S. Irani. Coloring inductive graphs on-line. In Proceedings of the of 31th Annual IEEE Symposium on Foudations of Computer Science, pages 470479, 1990.
11. H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33:143-153, 1981.
12. H. A. Kierstead and W. T. Trotter. On-line graph coloring. In Lyle A. McGeoch and Daniel D. Sleator, editors, On-line Algorithms, volume 7 of DIM AC S Series in Discrete Mathematics and Theoretical Computer Science, pages 85-92. AMS/ACM, February 1991.
13. S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosen. Online randomized call-control revisited. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 323-332, 1998.
14. L. Lovâsz, M. Saks, and W.T. Trotter. An on-line graph coloring algorithm with sublinear performance ratio. Discrete Mathematics, 75:319325, 1989.
15. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 133-143, 1994.
16. D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM, 28:202-208, 1985.
17. S. Vishwanathan. Randomized on-line graph coloring. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 121-130, 1990.
18. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.