Shahrokhi, Farhad; Matula, D. W. The maximum concurrent flow problem. (English) Zbl 0696.68071 J. Assoc. Comput. Mach. 37, No. 2, 318-334 (1990). Cited in 2 ReviewsCited in 55 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science 90B10 Deterministic network models in operations research Keywords:routing; graph algorithms; path and circuit problems; network partitioning; primal-dual algorithms; maximum concurrent flow; multicommodity flow; polynomial-time approximation scheme PDFBibTeX XMLCite \textit{F. Shahrokhi} and \textit{D. W. Matula}, J. Assoc. Comput. Mach. 37, No. 2, 318--334 (1990; Zbl 0696.68071) Full Text: DOI