Approximate Max--ow Min-(multi)cut Theorems and Their Applications
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Edge-Deletion Problems , 1981, SIAM J. Comput..
[2] 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.
[3] William H. Cunningham. The Optimal Multiterminal Cut Problem , 1989, Reliability Of Computer And Communication Networks.
[4] Philip N. Klein,et al. Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.
[5] Spyros Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .