On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing

DOI10.1007/11922377_7zbMath1137.68317OpenAlexW2114784909MaRDI QIDQ5385934

Mordechai Shalom, Shmuel Zaks, Michele Flammini

Publication date: 17 April 2008

Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11922377_7

zbMATH Keywords

Add-Drop Multiplexer (ADM)Optical NetworksWavelength AssignmentWavelength Division Multiplexing(WDM)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

This page was built for publication: On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing