The following pages link to (Q4537731):
Displayed 8 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- Maximizing residual capacity in connection-oriented networks (Q955490) (← links)
- A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)