On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing

DOI10.1016/j.jpdc.2006.12.002zbMath1115.68017OpenAlexW2088887132MaRDI QIDQ878685

Mordechai Shalom, Michele Flammini, Shmuel Zaks

Publication date: 26 April 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.12.002

zbMATH Keywords

optical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignment

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Minimization of SONET ADMs in ring networks revisited ⋮ On equilibria for ADM minimization games

This page was built for publication: On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing