Maximizing profits of routing in WDM networks

DOI10.1007/s10878-005-2263-0zbMath1093.90071OpenAlexW1985134401MaRDI QIDQ813327

Kang Li, Jianping Li, Lusheng Wang, Hao. Zhao

Publication date: 8 February 2006

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-2263-0

zbMATH Keywords

approximation algorithmpath coloringroutingminimum-cost flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

On packing and coloring hyperedges in a cycle ⋮ An experimental study of maximum profit wavelength assignment in WDM rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the \(k\)-coloring of intervals
• Efficient routing in all-optical networks
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The Ring Loading Problem