Academic
Publications
Approximate max-flow min-(multi)cut theorems and their applications

Approximate max-flow min-(multi)cut theorems and their applications,10.1145/167088.167266,Naveen Garg,Vijay V. Vaziranit,Mihalis Yannakakis

Approximate max-flow min-(multi)cut theorems and their applications   (Citations: 159)
BibTex | RIS | RefWorks Download
Consider the multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-flow min-multicut theorem: min multicut O(log k)
Conference: ACM Symposium on Theory of Computing - STOC , pp. 698-707, 1993
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: