## An O(log k) approximate min-cut max-flow theorem and approximation algorithm (1998)

by
Yonatan Aumann
,
Yuval Rabani

Venue: | SIAM J. Comput |

Citations: | 124 - 6 self |

### BibTeX

@ARTICLE{Aumann98ano(log,

author = {Yonatan Aumann and Yuval Rabani},

title = {An O(log k) approximate min-cut max-flow theorem and approximation algorithm},

journal = {SIAM J. Comput},

year = {1998},

volume = {27},

pages = {291--301}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log 2 k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.