Abstract
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.
This work was supported in part by the European Union under IST FET Project ALCOM{FT and Improving RTN Project ARACNE. Afonso Ferreira and Stéphane Pérennes are researchers with the French CNRS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Randomized path coloring on binary trees. In Proc. of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’00), LNCS 1913, Springer, pp. 60–71, 2000.
B. Beauquier. Communications dans les réseaux optiques par multiplexage en longueur d’onde. PhD thesis, Université de Nice-Sophia Antipolis, 2000.
J-C. Bermond, L. Gargano, S. Pérennes, A. A. Rescigno, and U. Vaccaro. Efficient collective communication in optical networks. In Proc. of the 23rd International Colloquium on Automata, Languages and Programming (ICALP’96), LNCS 1099, Springer, pp. 574–585, 1996.
I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: An approach to high bandwidth optical WAN’s. IEEE Transactions on Communications, 40(7):1171–1182, 1992.
T. Erlebach and K. Jansen. The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science, Vol. 255 (1-2), pp. 33–50, 2001.
T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing on directed fiber trees. Theoretical Computer Science, 221(1-2):119–137, 1999.
N. Garg. Multicommodity Flows and Approximation Algorithms. PhD thesis, Indian Institute of Technology, Delhi, April 1994.
L. Gargano, P. Hell, and S. Pérennes. Colouring paths in directed symmetric trees with applications to WDM routing. In Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP’97), LNCS 1256, Springer, pp. 505–515, 1997.
M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.
M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2. Springer, 2nd corrected edition, 1993.
I. A. Karapetian. On coloring of arc graphs. Doklady Akad. Nauk Armianskoi CCP, 70(5):306–311, 1980. (In Russian)
V. Kumar. Approximating circular arc colouring and bandwidth allocation in all-optical ring networks. In Proc. of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’98), 1998.
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, 55(2):221–232, 1985.
A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493–502, November 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caragiannis, I., Ferreira, A., Kaklamanis, C., Pérennes, S., Rivano, H. (2001). Fractional Path Coloring with Applications to WDM Networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_60
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive