Data structures and network algorithms
Data structures and network algorithms
Concurrent flow and concurrent connectivity on graphs
Graph theory with applications to algorithms and computer science
Computer networks
Two flow routing algorithms for the maximum concurrent flow problem
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Algorithms for Network Programming
Algorithms for Network Programming
Design and analysis of efficient algorithms to solve the maximum concurrent flow problem
Design and analysis of efficient algorithms to solve the maximum concurrent flow problem
The maximum concurrent flow problem
Journal of the ACM (JACM)
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A nondifferentiable optimization approach to ratio-cut partitioning
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
| Hi-index | 0.00 |
The maximum concurrent flow problem (MCFP) is readily illustrated by problems such as traffic flow in road networks and message transfer in packet switched networks. The MCFP was introduced in [MA85] and can be solved using either linear programming techniques or using the flow routing algorithms [BM86, TM86]. Application of these techniques has typically been limited to problems of small size (40 vertices or less). We present a refinement of the algorithm in [BM86] which operates successfully on problems three times larger than those solved by the previous techniques. Empirical polynomially bounded storage and time complexity is demonstrated and applications in packet switched networks are investigated.