An approximation algorithm for multiroute flow decomposition
From MaRDI portal
Publication:325487
DOI10.1016/J.ENDM.2016.03.048zbMATH Open1351.90059OpenAlexW2402734550MaRDI QIDQ325487FDOQ325487
Authors: Vorapong Suppakitpaisarn 
Publication date: 18 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.048
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
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- An improved algorithm for decomposing arc flows into multipath flows
- On multiroute maximum flows in networks.
- A method for obtaining the maximum \((\delta ,\eta )\)-balanced flow in a network
- Title not available (Why is that?)
Cited In (9)
- 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
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
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)
