Fractional Path Coloring with Applications to WDM Networks

This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (WDM) all-optical networks.

[1]  Naveen Garg Multicommodity Flows and Approximation Algorithms , 1994 .

[2]  Ioannis Caragiannis,et al.  Randomized path coloring on binary trees , 2000, APPROX.

[3]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[4]  Thomas Niessen,et al.  The round-up property of the fractional chromatic number for proper circular arc graphs , 2000 .

[5]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[6]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[7]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[8]  Vijay Kumar,et al.  Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.

[9]  Klaus Jansen,et al.  The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..

[10]  Bruno Beauquier,et al.  Communications dans les reseaux optiques par multiplexage en longueur d'onde , 2000 .

[11]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[12]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[13]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[14]  Stéphane Pérennes,et al.  Efficient collective communication in optical networks , 1996, Theor. Comput. Sci..

[15]  Stéphane Pérennes,et al.  Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing , 1997, ICALP.