Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut
暂无分享,去创建一个
[1] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[2] Andrew V. Goldberg,et al. An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.
[3] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Clifford Stein,et al. Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.
[5] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[6] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[7] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .
[8] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..