Skip to main content
SpringerLink
Log in

Fractional Path Coloring with Applications to WDM Networks

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Chapter  Google Scholar 

  2. B. Beauquier. Communications dans les réseaux optiques par multiplexage en longueur d’onde. PhD thesis, Université de Nice-Sophia Antipolis, 2000.

    Google Scholar 

  3. 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.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  7. N. Garg. Multicommodity Flows and Approximation Algorithms. PhD thesis, Indian Institute of Technology, Delhi, April 1994.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2. Springer, 2nd corrected edition, 1993.

    Google Scholar 

  11. I. A. Karapetian. On coloring of arc graphs. Doklady Akad. Nauk Armianskoi CCP, 70(5):306–311, 1980. (In Russian)

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  14. R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221–232, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493–502, November 1975.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500, Rio, Greece

    Ioannis Caragiannis & Christos Kaklamanis

  2. MASCOTTE Project, I3S & INRIA Sophia Antipolis, B.P. 93, 06902, Sophia Antipolis, Cedex, France

    Afonso Ferreira, Stéphane Pérennes & Hervé Rivano

Authors
  1. Ioannis Caragiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Afonso Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christos Kaklamanis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stéphane Pérennes
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hervé Rivano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, C/Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  2. Computer Technology Institute (CTI), University of Patras, 61 Riga Feraiou street, 26221, Patras, Greece

    Paul G. Spirakis

  3. Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Jan van Leeuwen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation