Pages that link to "Item:Q551206"
From MaRDI portal
The following pages link to Approximation algorithms for grooming in optical network design (Q551206):
Displaying 8 items.
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)
- A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368) (← links)
- Lower bounds for two-period grooming via linear programming duality (Q3548731) (← links)
- Path decomposition under a new cost measure with applications to optical network design (Q4962708) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- Algorithms – ESA 2004 (Q5464613) (← links)