A GOOD ALGORITHM FOR LEXICOGRAPHICALLY OPTIMAL FLOWS IN MULTI-TERMINAL NETWORKS
暂无分享,去创建一个
[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.
[2] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[3] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[4] Nimrod Megiddo,et al. Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..
[5] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .
[6] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..