An approximation algorithm for multiroute flow decomposition
From MaRDI portal
Recommendations
- On multiroute maximum flows in networks.
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- A fast algorithm of constructing decomposition of multipole flows
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
Cites work
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- A method for obtaining the maximum \((\delta ,\eta )\)-balanced flow in a network
- An improved algorithm for decomposing arc flows into multipath flows
- On multiroute maximum flows in networks.
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Cited in
(9)- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
- The multiroute maximum flow problem revisited
- A decomposition algorithm for circuit routing
- Multiroute flows: cut-trees and realizability
- A fast algorithm of constructing decomposition of multipole flows
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- Multiterminal global routing: A deterministic approximation scheme
This page was built for publication: An approximation algorithm for multiroute flow decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325487)
