The following pages link to The ring grooming problem (Q4651930):
Displayed 7 items.
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Traffic grooming in bidirectional WDM ring networks (Q3113504) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)