Pages that link to "Item:Q1975964"
From MaRDI portal
The following pages link to On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964):
Displaying 8 items.
- On routing in VLSI design and communication networks (Q944702) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- On the disjoint paths problem (Q2643811) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
