An improved algorithm for decomposing arc flows into multipath flows

Authors:
Donglei Du;Santosh N. Kabadi
Affiliations:
Faculty of Administration, University of New Brunswick, P.O. Box 4400, Fredericton, NB, Canada E3B 5A3;Faculty of Administration, University of New Brunswick, P.O. Box 4400, Fredericton, NB, Canada E3B 5A3
Venue:
Operations Research Letters
Year:
2006

Citing 7
Cited 2

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A faster deterministic maximum flow algorithm

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Multiroute flow problem

Multiroute flow problem
Multi-terminal multipath flows: synthesis

Discrete Applied Mathematics
The multiroute maximum flow problem revisited

Networks
Flows over edge-disjoint mixed multipaths and applications

Discrete Applied Mathematics
Integer version of the multipath flow network synthesis problem

Discrete Applied Mathematics

Integer version of the multipath flow network synthesis problem

Discrete Applied Mathematics
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation.