Pages that link to "Item:Q3404459"
From MaRDI portal
The following pages link to Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459):
Displaying 12 items.
- Designing WDM optical networks using branch-and-price (Q387309) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Multiobjective swarm intelligence for the traffic grooming problem (Q2340529) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368) (← links)
- Network design with grooming constraints (Q3439127) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Traffic Grooming in Star Networks via Matching Techniques (Q3569115) (← links)
- Computational Science – ICCS 2005 (Q5709467) (← links)
- Structural Information and Communication Complexity (Q5710095) (← links)
- Algorithms and Computation (Q5897923) (← links)