Improved bounds on the max-flow min-cut ratio for multicommodity flows
暂无分享,去创建一个
[1] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.
[2] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[3] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..
[4] Paul D. Seymour,et al. Packing directed circuits fractionally , 1995, Comb..
[5] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[6] Serge A. Plotkin,et al. Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows , 1993 .
[7] M. Yannakakis,et al. Approximate Max--ow Min-(multi)cut Theorems and Their Applications , 1993 .
[8] 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.
[9] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[10] Spyros Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .
[11] Haruko Okamura,et al. Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.
[12] D. R. Fulkerson,et al. Flows in Networks. , 1964 .