V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano, Randomized Path Coloring on Binary Trees, APPROX'00, pp.60-71, 2000.
DOI : 10.1007/3-540-44436-X_8

K. Azuma, Weighted sums of certain dependent random variables, Tohoku Mathematical Journal, vol.19, issue.3, pp.357-367, 1967.
DOI : 10.2748/tmj/1178243286

J. Bermond, L. Gargano, S. Pérennes, A. A. Rescigno, and U. Vaccaro, Efficient collective communication in optical networks, ICALP'96, pp.574-585, 1996.
DOI : 10.1007/3-540-61440-0_160

I. Caragiannis and C. Kaklamanis, Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks, Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS '04), pp.258-269, 2004.
DOI : 10.1007/978-3-540-24749-4_23

I. Caragiannis, C. Kaklamanis, and P. Persiano, Approximation Algorithms for Path Coloring in Trees, Chapter in Efficient Approximation and Online Algorithms, pp.74-96, 2006.
DOI : 10.1007/11671541_3

I. Caragiannis, C. Kaklamanis, P. Persiano, and A. Sidiropoulos, Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees, Proceedings of the 1st Workshop on Approximation and On-line Algorithms (WAOA '03), pp.81-94, 2003.
DOI : 10.1007/978-3-540-24592-6_7

I. Chlamtac, A. Ganz, and G. Karmi, Lightpath communications: an approach to high bandwidth optical WAN's, IEEE Transactions on Communications, vol.40, issue.7, pp.1171-1182, 1992.
DOI : 10.1109/26.153361

T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano, Optimal wavelength routing on directed fiber trees, Theoretical Computer Science, vol.221, issue.1-2, pp.119-137, 1999.
DOI : 10.1016/S0304-3975(99)00029-8

U. Feige and J. Kilian, Zero Knowledge and the Chromatic Number, Journal of Computer and System Sciences, vol.57, issue.2, pp.187-199, 1998.
DOI : 10.1006/jcss.1998.1587

A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier, On the design of multifiber WDM networks, pp.25-32, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00429849

N. Garg, Multicommodity Flows and Approximation Algorithms, 1994.

N. Garg, V. V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, vol.11, issue.5, pp.3-20, 1997.
DOI : 10.1007/BF02523685

L. Gargano, P. Hell, and S. Pérennes, Colouring paths in directed symmetric trees with applications to WDM routing, ICALP'97, pp.505-515, 1997.
DOI : 10.1007/3-540-63165-8_206

M. C. Golumbic and R. E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.8-22, 1985.
DOI : 10.1016/0095-8956(85)90088-7

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981.
DOI : 10.1007/BF02579273

D. S. Hochbaum and E. , Approximation Algorithms for N P -Hard Problems, 1997.

K. Jansen, Approximate strong separation with application in fractional graph coloring and preemptive scheduling, Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS '02), pp.100-111, 2002.

I. A. Karapetyan, On coloring of arc graphs Doklady Akad, Nauk Armianskoi CCP, vol.70, issue.5, pp.306-311, 1980.

V. Kumar, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, APPROX'98, 1998.
DOI : 10.1007/BFb0053971

L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Mathematics, vol.13, issue.4, pp.383-390, 1975.
DOI : 10.1016/0012-365X(75)90058-8

T. Niessen and J. Kind, The round-up property of the fractional chromatic number for proper circular arc graphs, Journal of Graph Theory, 1998.

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2
URL : http://doi.org/10.1016/0012-365x(85)90051-2

A. Tucker, Coloring a Family of Circular Arcs, SIAM Journal on Applied Mathematics, vol.29, issue.3, pp.493-502, 1975.
DOI : 10.1137/0129040