On the Complexity of the Traffic Grooming Problem in Optical Networks

DOI10.1007/978-3-540-72914-3_23zbMath1201.68021OpenAlexW1564787786MaRDI QIDQ5426031

Walter Unger, Shmuel Zaks, Mordechai Shalom

Publication date: 15 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72914-3_23

zbMATH Keywords

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Hardness and approximation of traffic grooming ⋮ Approximating the traffic grooming problem in tree and star networks ⋮ Hardness and Approximation of Traffic Grooming ⋮ Approximating the traffic grooming problem

This page was built for publication: On the Complexity of the Traffic Grooming Problem in Optical Networks