Satisfying a maximum number of pre-routed requests in all-optical rings.

DOI10.1016/S1389-1286(02)00448-6zbMath1035.68086MaRDI QIDQ1400411

Christos Nomikos, Stathis Zachos, Aris Pagourtzis

Publication date: 13 August 2003

Published in: Computer Networks (Search for Journal in Brave)

zbMATH Keywords

Approximation algorithmsAll-optical ringsMaximum path coloringWavelength assignment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Stathis Zachos at 70! ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ An experimental study of maximum profit wavelength assignment in WDM rings ⋮ 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings ⋮ Inapproximability and approximability of maximal tree routing and coloring ⋮ Maximizing profits of routing in WDM networks

This page was built for publication: Satisfying a maximum number of pre-routed requests in all-optical rings.