Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)

Volumn 19, Issue 2, 1972, Pages 248-264

  Edmonds, Jack ^a   Karp, Richard M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

analysis of algorithms; network flows; transportation problem

Indexed keywords

FLOWS IN NETWORKS;

OPERATIONS RESEARCH;

EID: 0015330635     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321694.321699     Document Type: Article

References (7)

1. Dinic, E. A. Algorithm for solution of a problem of maximum flow in a network with power estimation. Sov. Math. Dokl. 11 (1970), 1277-1280.
2. Edmonds, J. Paths, trees and flowers. Canadian J. Math. 17 (1965), 449-467.
3. Edmonds, J., and Karp, R. M. Theoretical improvements in algorithmic efficiency for network How problems. Combinatorial Structures and Their Applications. Gordon and Breach, New York, 1970, pp. 93-96.
4. Edmonds. J., and Fulkerson, D. R. Bottleneck extrema. RAND Corp. Memorandum RM-5375-PR (Jan. 1968).
5. Ford, L. R., and Fulkerson, D. R. Flows in Networks. Princeton U. Press, Princeton, N. J., 1962.
6. Fulkekson, D. R. on the equivalence of the capacity-constrained transshipment problem and the Hitchcock problems. RAND Corp. Memorandum RM-2480 (Jan. 1960).
7. Wagner, H. M. On a class of capacitatcd transportation problems. Manag. Set. 5 (1959), 304-318.