Algorithms and Computation

DOI10.1007/11602613zbMath1175.90089OpenAlexW2304246803MaRDI QIDQ5897923

Mordechai Shalom, Luca Moscardelli, Shmuel Zaks, Michele Flammini

Publication date: 14 November 2006

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation algorithms (68W25)

Related Items (5)

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Approximating the traffic grooming problem in tree and star networks ⋮ Hardness and Approximation of Traffic Grooming ⋮ Minimizing total busy time in parallel scheduling with application to optical networks

This page was built for publication: Algorithms and Computation