1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings

DOI10.1016/j.ipl.2008.12.010zbMath1191.68859OpenAlexW2063944421MaRDI QIDQ976131

Qian-Ping Gu, Zhengbing Bian

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.010

zbMATH Keywords

ring networksapproximation algorithmsrouting and path coloring

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

An experimental study of maximum profit wavelength assignment in WDM rings

Cites Work

• Satisfying a maximum number of pre-routed requests in all-optical rings.
• On the \(k\)-coloring of intervals
• Efficient routing in all-optical networks
• The Complexity of Coloring Circular Arcs and Chords
• Coloring a Family of Circular Arcs
• Algorithms and Data Structures
• Wavelength Management in WDM Rings to Maximize the Number of Connections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings