Routing to reduce the cost of wavelength conversion

DOI10.1016/j.dam.2007.12.001zbMath1169.05379OpenAlexW2006027686MaRDI QIDQ1005233

Stamatis Stefanakos, Erlebach, Thomas

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.12.001

zbMATH Keywords

sufficient setgraph algorithmsoptical networkspath coloringwavelength conversionwavelength assignment

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the hardness of approximating minimum vertex cover
• Wavelength conversion in all-optical networks with shortest-path routing
• Optimization, approximation, and complexity classes
• Algorithms for routing around a rectangle
• Some APX-completeness results for cubic graphs
• Algorithmic graph theory and perfect graphs
• Wavelength Conversion in Optical Networks
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Sparse and limited wavelength conversion in all-optical tree networks

This page was built for publication: Routing to reduce the cost of wavelength conversion