Pages that link to "Item:Q3522952"
From MaRDI portal
The following pages link to Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952):
Displaying 10 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Traffic Grooming in Star Networks via Matching Techniques (Q3569115) (← links)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) (← links)
- Structural Information and Communication Complexity (Q5315217) (← links)
- Algorithms and Computation (Q5897923) (← links)