论文信息 - Fractional path coloring on bounded degree trees

Fractional path coloring on bounded degree trees

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] Bruno Beauquier,et al. Communications dans les reseaux optiques par multiplexage en longueur d'onde , 2000 .

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

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

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

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

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

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

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

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

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

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

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

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