Pages that link to "Item:Q1018099"
From MaRDI portal
The following pages link to Approximating the traffic grooming problem (Q1018099):
Displaying 10 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- On ring grooming in optical networks (Q2385478) (← links)
- A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Structural Information and Communication Complexity (Q5315217) (← links)
- Algorithms and Computation (Q5897923) (← links)