Fractional path coloring with applications to WDM networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 732-743

  Caragiannis, Ioannis ^a   Ferreira, Afonso ^b   Kaklamanis, Christos ^a   Pérennes, Stéphane ^b   Rivano, Hervé ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COLOR; COMPUTATIONAL LINGUISTICS; DIRECTED GRAPHS;

ALL- OPTICAL NETWORKS; COMBINATORIAL PROBLEM; DIRECTED PATHS; NATURAL RELAXATION; PATH COLORINGS; WDM NETWORKS;

DIRECTED GRAPHS; WAVELENGTH DIVISION MULTIPLEXING;

EID: 84879535245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_60     Document Type: Conference Paper

References (15)

1. 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.
2. B. Beauquier. Communications dans les ŕeseaux optiques par multiplexage en longueur d'onde. PhD thesis, Universit́e de Nice-Sophia Antipolis, 2000.
3. J-C. Bermond, L. Gargano, S. Ṕerennes, 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.
4. 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.
5. T. Erlebach and K. Jansen. The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science, Vol. 255 (1-2), pp. 33-50, 2001.
6. 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.
7. N. Garg. Multicommodity Flows and Approximation Algorithms. PhD thesis, Indian Institute of Technology, Delhi, April 1994.
8. L. Gargano, P. Hell, and S. Ṕerennes. 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.
9. M. Gr̈otschel, L. Lov́asz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981.
10. M. Gr̈otschel, L. Lov́asz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2. Springer, 2nd corrected edition, 1993.
11. I. A. Karapetian. On coloring of arc graphs. Doklady Akad. Nauk Armi-anskoi CCP, 70(5):306-311, 1980. (In Russian)
12. 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.
13. T. Niessen and J. Kind. The round-up property of the fractional chromatic number for proper circular arc graphs. Journal of Graph Theory, 1998.
14. R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221-232, 1985.
15. A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493-502, November 1975.