A Refined Analysis of Online Path Coloring in Trees

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10138)

Abstract

Our results are on the online version of path coloring in trees where each request is a path to be colored online, and two paths that share an edge must get different colors. For each T, we come up with a hierarchical partitioning of its edges with a minimum number of parts, denoted by h(T), and design an O(h(T))-competitive online algorithm. We then use the lower bound technique of Bartal and Leonardi [1] along with a structural property of the hierarchical partitioning, to show a lower bound of \(\varOmega (h(T)/\log (4h(T)))\) for each tree T on the competitive ratio of any deterministic online algorithm for the problem. This gives us an insight into online coloring of paths on each tree T, whereas the current tight lower bound results are known only for special trees like paths and complete binary trees.

References

  1. 1.
    Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Comput. Sci. 221(1–2), 19–39 (1999)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Erlebach, T., Jansen, K., Elvezia, C.: The complexity of path coloring and call scheduling. Theoret. Comput. Sci. 255, 2001 (2000)MathSciNetGoogle Scholar
  3. 3.
    Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180–187 (1972)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theor. Ser. B 16(1), 47–56 (1974)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math. 23(3), 211–227 (1978)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discrete Math. 55(2), 151–159 (1985)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Comb. Theo. Ser. B 38(1), 8–22 (1985)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Kaklamanis, C., Persiano, P.: Efficient wavelength routing on directed fiber trees. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 460–470. Springer, Heidelberg (1996). doi:10.1007/3-540-61680-2_75 CrossRefGoogle Scholar
  9. 9.
    Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33(143–153), 98 (1981)MATHMathSciNetGoogle Scholar
  10. 10.
    Kumar, V., Schwabe, E.J.: Improved access to optical bandwidth in trees. In Proceedings of SODA 1997, pp. 437–444 (1997)Google Scholar
  11. 11.
    Mihail, M., Kaklamanis, C., Rao, S.: Efficient access to optical bandwidth. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, p. 548. IEEE Computer Society, Washington, DC (1995)Google Scholar
  12. 12.
    Narayanaswamy, N.S., Subhash, R.: Babu. A note on first-fit coloring of interval graphs. Order 25(1), 49–53 (2008)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: Ian Munro, J. (ed.) SODA, pp. 562–571. SIAM (2004)Google Scholar
  14. 14.
    Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 134–143. ACM, New York (1994)Google Scholar
  15. 15.
    Takai, H., Kanatani, T., Matsubayashi, A.: Path coloring on binary caterpillars. IEICE Trans. 89–D(6), 1906–1913 (2006)CrossRefGoogle Scholar
  16. 16.
    Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55(2), 221–232 (1985)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River, NJ (2000)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations