Pages that link to "Item:Q325487"
From MaRDI portal
The following pages link to An approximation algorithm for multiroute flow decomposition (Q325487):
Displaying 8 items.
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths (Q2464225) (← links)
- Multiroute flows: cut-trees and realizability (Q2581318) (← links)
- A decomposition algorithm for circuit routing (Q3710289) (← links)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets (Q3801063) (← links)
- The multiroute maximum flow problem revisited (Q5469126) (← links)
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow (Q5746246) (← links)