Approximating the Traffic Grooming Problem in Tree and Star Networks
DOI10.1007/11917496_14zbMATH Open1167.68332OpenAlexW1587000517MaRDI QIDQ3522952FDOQ3522952
Authors: Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks 
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_14
Recommendations
- Approximating the traffic grooming problem in tree and star networks
- Algorithms and Computation
- Traffic Grooming in Star Networks via Matching Techniques
- Approximating the traffic grooming problem
- Hardness and Approximation of Traffic Grooming
- Hardness and approximation of traffic grooming
- Traffic Grooming: Combinatorial Results and Practical Resolutions
- Approximating capacitated tree-routings in networks
- Approximating Capacitated Tree-Routings in Networks
optical networkstree networksadd-drop multiplexer (ADM)traffic groomingwavelength division multiplexing (WDM)
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cited In (13)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
- Approximating the traffic grooming problem
- 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
- GMPLS label space minimization through hypergraph layouts
- Traffic Grooming in Star Networks via Matching Techniques
- Structural Information and Communication Complexity
- Traffic Grooming: Combinatorial Results and Practical Resolutions
- Designing hypergraph layouts to GMPLS routing strategies
- Algorithms and Computation
- Hardness and Approximation of Traffic Grooming
- On the complexity of the regenerator cost problem in general networks with traffic grooming
This page was built for publication: Approximating the Traffic Grooming Problem in Tree and Star Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522952)
