Traffic Grooming: Combinatorial Results and Practical Resolutions

DOI10.1007/978-3-642-02250-0_2zbMath1187.68027OpenAlexW2159678088MaRDI QIDQ3404459

Gianpiero Monaco, Shmuel Zaks, Tibor Cinkler, Luca Moscardelli, Michele Flammini, Mordechai Shalom, David Coudert, Ignasi Sau, Xavier Muñoz

Publication date: 9 February 2010

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_2

zbMATH Keywords

ADMWDM networksgrooming

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Designing WDM optical networks using branch-and-price

This page was built for publication: Traffic Grooming: Combinatorial Results and Practical Resolutions