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

Venue: | SIAM J. Comput |

Citations: | 126 - 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.

### Citations

10922 | Computers and Intractability: A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979 |

451 | The Geometry of Graphs and Some of its Algorithmic Applications - Linial, London, et al. - 1995 |

279 |
On Lipschitz embedding of finite metric spaces in Hilbert space
- Bourgain
- 1985
(Show Context)
Citation Context ...perty (i.e., it separates any two nodes with probability proportional to the distance between the two). With this intuition in mind, we use small distortion embeddings of finite metric spaces into ℓ1 =-=[3, 21]-=-. Once the (solution) graph is embedded in ℓ1, we show how to find (deterministically) a good cut. The factor of O(log k) is lost in the distortion of the embedding. We also show that similar ideas ar... |

271 |
Maximal flow through a network
- Ford, Fulkerson
- 1956
(Show Context)
Citation Context ...ving the lower bound of [3]. Related work. One of the most celebrated theorems in combinatorial optimization is the min-cut max-flow theorem of Ford and Fulkerson and of Elias, Feinstein, and Shannon =-=[8, 7]-=-, which states that for a single commodity, the maximum flow is equal to the minimum cut (here the two flavors of the problem coincide). Early on it had been noted that this is not the case for multic... |

239 | An Approximate Max-Flow Min-Cut Theorem For Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms - Leighton, Rao - 1988 |

234 | Multi-terminal Network Flows - Gomory, Hu - 1961 |

179 | Approximate graph coloring by semidefinite programming - Karger, Motwani, et al. - 1998 |

173 | Fast approximation algorithms for multicommodity flow problems - Leighton, Makedon, et al. - 1995 |

150 | The maximum concurrent flow problem - Shahrokhi, Matula - 1990 |

144 | Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications - Garg, Vazirani, et al. - 1996 |

123 | Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica - Garg, Vazirani, et al. - 1997 |

104 | Excluded minors, network decomposition, and multicommodity flow - Klein, Plotkin, et al. - 1993 |

76 | Multicommodity Flows in Planar Graphs - Okamura, Seymour - 1981 |

70 | 878-approximation algorithms for MAX CUT and MAX 2SAT - Goemans, Williamson - 1994 |

69 |
Note on maximum flow through a network
- Efias, Feinstein, et al.
- 1956
(Show Context)
Citation Context ...ving the lower bound of [3]. Related work. One of the most celebrated theorems in combinatorial optimization is the min-cut max-flow theorem of Ford and Fulkerson and of Elias, Feinstein, and Shannon =-=[8, 7]-=-, which states that for a single commodity, the maximum flow is equal to the minimum cut (here the two flavors of the problem coincide). Early on it had been noted that this is not the case for multic... |

68 | O(n 3 L) potential reduction algorithm for linear programming - Ye - 1991 |

64 |
The complexity of the multiway cuts
- Dalhaus, Johnson, et al.
- 1992
(Show Context)
Citation Context ...nces on arbitrary capacitated trees. The second paper gives an O(log k)-approximate min-multicut max-flow bound and approximation algorithm for arbitrary maximum throughput instances. Dahlhaus et al. =-=[5]-=- consider the problem of multiway cuts, i.e., multicuts for maximum throughput instances defined by listing all pairs among a subset of k vertices. They show a 2 − 2 k approximation algorithm. Of rela... |

54 | Explicit construction of concentrators - Margulis - 1973 |

46 | Approximation through multicommodity flow. Foundations of Computer Science - Klein, Agrawal, et al. - 1990 |

34 |
Lois stables et espaces L p
- Bretagnolle, Dacunha-Castelle, et al.
- 2005
(Show Context)
Citation Context ...lower bound. Corollary A.4. Any contraction of Mn into ℓ2 has distortion Ω(log n). Proof. Any finite Euclidean space is ℓ1-embeddable. (It is well known that L2 isometrically embeds in L1, see, e.g., =-=[4]-=-. For finite metric spaces, L1-embeddability implies ℓ1 embeddability; see [6].) Remark. The question of improving Bourgain’s lower bound was raised by Linial, London, and Rabinovich. A similar theore... |

30 | Matroids and Multicommodity Flows - Seymour - 1981 |

27 | Combinatorial approaches to multiflow problems - Lomonosov - 1985 |

25 | Applications of cut polyhedra I - Deza, Laurent - 1994 |

22 | Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows - Plotkin, Tardos - 1995 |

21 | Feasibility of two-commodity network flows - Rothschild, Whinston - 1966 |

17 |
The cut cone, L 1 embeddability, complexity and multicommodity flows
- Avis, Deza
- 1991
(Show Context)
Citation Context ...ail when it is required to minimize a cut rather than to maximize it. The relation between ℓ1-embeddability and multicommodity flow has been noteds294 YONATAN AUMANN AND YUVAL RABANI by Avis and Deza =-=[2]-=-. They show that Lomonosov’s min-cut-equals-max-flow result (and its predecessors for two commodities, etc.) is related directly to the ℓ1embeddability of certain fixed metric spaces. A central tool i... |

9 | VLSi partitioning approximation algorithms based on multicommodity flow and other techniques - Tragoudas - 1991 |

8 | The cut cone, L embeddability, complexity, and multicommodity flows - Avis, Deza - 1991 |

7 |
Flow Algorithms
- Adel'son-Vel'ski, Dinits, et al.
- 1975
(Show Context)
Citation Context ...created by connecting sourcedestination pairs) is either the union of two stars, or the clique K4, or the cycle C5, through the consecutive works of Hu [14], Rothschild and Whinston [28], Dinits (see =-=[1]-=-), Seymour [29], and Lomonosov [23]. Seymour [30] shows that equality holds when the union of the network and the support is planar. Okamura and Seymour [26] establish equality for instances on planar... |

4 | A deterministic O(log k)-approximation algorithm for the sparsest cut - Garg - 1995 |

3 | Lois stables et espaces L p . Annales de l'Institut Henri Poincar'e - Bretagnolle, Dacunha-Castelle, et al. - 1966 |

3 | Note on bi-Lipschitz embeddings into normed spaces - Matousek - 1992 |

2 | Flow Algorithms (in Russian - Adelson-Welsky, Dinits, et al. - 1975 |

2 | Four terminous flows - Seymour - 1980 |

2 | Embeddings and Extentions in Analysis - Wells, Williams - 1975 |