An approximation algorithm for multiroute flow decomposition

DOI10.1016/J.ENDM.2016.03.048zbMath1351.90059OpenAlexW2402734550MaRDI QIDQ325487

Vorapong Suppakitpaisarn

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.048

zbMATH Keywords

network flowflow decompositiongraph optimization algorithmmultiroute flowrobust communication

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• 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 (δ,η)-Balanced Flow in a Network

This page was built for publication: An approximation algorithm for multiroute flow decomposition