Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Tóm tắt
Từ khóa
Tài liệu tham khảo
DINIC , E.A. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soy. Math. Dokl. 11 ( 1970 ), 1277 - 1280 . DINIC, E.A. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soy. Math. Dokl. 11 (1970), 1277-1280.
EDMONDS , J. Paths, trees and flowers. Canadian J. Math. 17 ( 1965 ), 449 467 . EDMONDS, J. Paths, trees and flowers. Canadian J. Math. 17 (1965), 449 467.
EDMONDS , J. , AND KARP , R.M. Theoretical improvements in algorithmic efficiency for network flow problems . Combinatorial Structures and Their Applications. Gordon and Breach , New York , 1970 , pp. 93 - 96 (abstract presented at Calgary International Conference on Combinatorial Structures and Their Applications, June 1969). EDMONDS, J., AND KARP, R.M. Theoretical improvements in algorithmic efficiency for network flow problems. Combinatorial Structures and Their Applications. Gordon and Breach, New York, 1970, pp. 93-96 (abstract presented at Calgary International Conference on Combinatorial Structures and Their Applications, June 1969).
EDMONDS , J. , AND FULKERSON , D. R. Bottleneck extrema . RAND Corp. Memorandum RM- 5375-PR ( Jan. 1968 ). EDMONDS, J., AND FULKERSON, D. R. Bottleneck extrema. RAND Corp. Memorandum RM-5375-PR (Jan. 1968).
FORD , L. I{., AND FULKERSON , I). R. Flows in Networks . Princeton U. Press , Princeton, N.J. , 1962 . FORD, L. I{., AND FULKERSON, I). R. Flows in Networks. Princeton U. Press, Princeton, N.J., 1962.
FULKERSON , D. ll. On the equivalence of the capacity-constrained transshipment problem and the Hitchcock problems . RAND Corp. Memorandum RM- 2480 ( Jan. 1960 ). FULKERSON, D. ll. On the equivalence of the capacity-constrained transshipment problem and the Hitchcock problems. RAND Corp. Memorandum RM-2480 (Jan. 1960).