Randomized Lower Bounds for Online Path Coloring

  • Stefano Leonardi
  • Andrea Vitaletti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1518)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAP93]
    B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32–40, 1993.Google Scholar
  2. [AGLR94]
    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.Google Scholar
  3. [BDBK+90]
    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.Google Scholar
  4. [BEY98]
    A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.Google Scholar
  5. [BFL96]
    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.Google Scholar
  6. [BL97]
    Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloqium on Automata, Languages and Programming, LNCS 1256, pages 516–526. Springer-Verlag, 1997.Google Scholar
  7. [Gol80]
    M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, NY, 1980.MATHGoogle Scholar
  8. [GSR96]
    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 34th Allerton Conference on Communication, Control, and Computing, 1996.Google Scholar
  9. [HS92]
    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.Google Scholar
  10. [Ira90]
    S. Irani. Coloring inductive graphs on-line. In Proceedings of the of 31th Annual IEEE Symposium on Foudations of Computer Science, pages 470–479, 1990.Google Scholar
  11. [KT81]
    H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33:143–153, 1981.MathSciNetGoogle Scholar
  12. [KT91]
    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 DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 85–92. AMS/ACM, February 1991.Google Scholar
  13. [LMSPR98]
    S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosèn. On-line randomized call-control revisited. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 323–332, 1998.Google Scholar
  14. [LST89]
    L. Lovász, M. Saks, and W.T. Trotter. An on-line graph coloring algorithm with sublinear performance ratio. Discrete Mathematics, 75:319–325, 1989.MATHCrossRefMathSciNetGoogle Scholar
  15. [RU94]
    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.Google Scholar
  16. [ST85]
    D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM, 28:202–208, 1985.CrossRefMathSciNetGoogle Scholar
  17. [Vis90]
    S. Vishwanathan. Randomized on-line graph coloring. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 121–130, 1990.Google Scholar
  18. [Yao77]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Stefano Leonardi
    • 1
  • Andrea Vitaletti
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly

Personalised recommendations