Pages that link to "Item:Q837166"
From MaRDI portal
The following pages link to Hardness and approximation of traffic grooming (Q837166):
Displaying 8 items.
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← 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)
