Approximating the traffic grooming problem

DOI10.1016/J.JDA.2007.09.001zbMath1160.90342OpenAlexW2007087349MaRDI QIDQ1018099

Shmuel Zaks, Michele Flammini, Mordechai Shalom, Luca Moscardelli

Publication date: 13 May 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.09.001

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (1)

Hardness and approximation of traffic grooming

Cites Work

• Unnamed Item
• A Greedy Heuristic for the Set-Covering Problem
• The SONET edge‐partition problem
• On the Complexity of the Traffic Grooming Problem in Optical Networks
• Structural Information and Communication Complexity

This page was built for publication: Approximating the traffic grooming problem