Traffic Grooming: Combinatorial Results and Practical Resolutions

DOI10.1007/978-3-642-02250-0_2zbMATH Open1187.68027OpenAlexW2159678088MaRDI QIDQ3404459FDOQ3404459

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)

Cited In (5)

• Hardness and approximation of traffic grooming
• Designing WDM optical networks using branch-and-price
• Traffic Grooming in Star Networks via Matching Techniques
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• Algorithms and Computation

Recommendations

• Hardness and approximation of traffic grooming 👍 👎
• Approximating the traffic grooming problem in tree and star networks 👍 👎
• On the Complexity of the Traffic Grooming Problem in Optical Networks 👍 👎
• Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks 👍 👎
• Algorithms and Computation 👍 👎
• Approximating the Traffic Grooming Problem in Tree and Star Networks 👍 👎
• Hardness and Approximation of Traffic Grooming 👍 👎
• Approximating the traffic grooming problem 👍 👎
• A Cost-Efficient Scheduling Algorithm for Traffic Grooming 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404459)