Traffic Grooming: Combinatorial Results and Practical Resolutions
From MaRDI portal
Publication:3404459
Recommendations
- Approximating the traffic grooming problem
- Algorithms and Computation
- Hardness and Approximation of Traffic Grooming
- Hardness and approximation of traffic grooming
- Approximating the traffic grooming problem in tree and star networks
- A cost-efficient scheduling algorithm for traffic grooming
- Approximating the Traffic Grooming Problem in Tree and Star Networks
- Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
- On the Complexity of the Traffic Grooming Problem in Optical Networks
Cited In (14)
- Network design with grooming constraints
- Multiobjective swarm intelligence for the traffic grooming problem
- Approximation algorithms for grooming in optical network design
- Hardness and approximation of traffic grooming
- Designing WDM optical networks using branch-and-price
- Traffic grooming on the path
- Traffic Grooming in Star Networks via Matching Techniques
- Telecommunication network grooming
- Approximating the Traffic Grooming Problem in Tree and Star Networks
- Reformulation and decomposition approaches for traffic routing in optical networks
- Computational Science – ICCS 2005
- Algorithms and Computation
- Structural Information and Communication Complexity
- A traffic-grooming algorithm for wavelength-routed optical networks
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)