Pages that link to "Item:Q5387787"
From MaRDI portal
The following pages link to Hardness and Approximation of Traffic Grooming (Q5387787):
Displaying 8 items.
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)
- Algorithms and Computation (Q5897923) (← links)