On the Complexity of the Traffic Grooming Problem in Optical Networks
From MaRDI portal
Publication:5426031
DOI10.1007/978-3-540-72914-3_23zbMath1201.68021MaRDI 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
optical networks; add-drop multiplexer (ADM); wavelength division multiplexing (WDM); wavelength assignment
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
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