1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
From MaRDI portal
Publication:976131
DOI10.1016/J.IPL.2008.12.010zbMATH Open1191.68859OpenAlexW2063944421MaRDI QIDQ976131FDOQ976131
Authors: Zhengbing Bian, Qian-Ping Gu 
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
Recommendations
- Approximation algorithms for constructing wavelength routing networks
- Solving routing and wavelength assignment problem with maximum edge-disjoint paths
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Wavelength assignment algorithms on trees on rings under different communication models
- Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs
- scientific article; zbMATH DE number 1500650
- Efficient algorithms for wavelength assignment on trees of rings
- scientific article; zbMATH DE number 1787332
- An algorithm for node-capacitated ring routing
Cites Work
- On the \(k\)-coloring of intervals
- Title not available (Why is that?)
- The Complexity of Coloring Circular Arcs and Chords
- Coloring a Family of Circular Arcs
- Title not available (Why is that?)
- Efficient routing in all-optical networks
- Title not available (Why is that?)
- Satisfying a maximum number of pre-routed requests in all-optical rings.
- Title not available (Why is that?)
- Routing and call control algorithms for ring networks.
- Wavelength Management in WDM Rings to Maximize the Number of Connections
Cited In (3)
This page was built for publication: 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976131)
