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

被引：153

作者：

Aumann, Y ^{[1
]}

Rabani, Y

机构：

[1] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel

[2] MIT, Comp Sci Lab, Cambridge, MA 02139 USA

[3] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel

来源：

SIAM JOURNAL ON COMPUTING | 1998年 / 27卷 / 01期

关键词：

approximation algorithms; cuts; sparse cuts; network flow; multicommodity flow;

D O I：

10.1137/S0097539794285983

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：291 / 301

页数：11

共 50 条

[21] Ehrhart clutters: Regularity and Max-Flow Min-Cut
Martinez-Bernal, Jose
O'Shea, Edwin
Villarreal, Rafael H.
ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
[22] ON THE RELATION OF MAX-FLOW TO MIN-CUT FOR GENERALIZED NETWORKS
PULAT, PS
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 39 (01) : 103 - 107
[23] RECOGNIZING MAX-FLOW MIN-CUT PATH MATRICES
HARTVIGSEN, DB
WAGNER, DK
OPERATIONS RESEARCH LETTERS, 1988, 7 (01) : 37 - 42
[24] A CHARACTERIZATION OF KNAPSACKS WITH THE MAX-FLOW MIN-CUT PROPERTY
LAURENT, M
SASSANO, A
OPERATIONS RESEARCH LETTERS, 1992, 11 (02) : 105 - 110
[25] A DECOMPOSITION OF THE MATROIDS WITH THE MAX-FLOW MIN-CUT PROPERTY
TSENG, FT
TRUEMPER, K
DISCRETE APPLIED MATHEMATICS, 1986, 15 (2-3) : 329 - 364
[26] Feature detection using curvature maps and the min-cut/max-flow algorithm
Gatzke, Timothy
Grimm, Cindy
GEOMETRIC MODELING AND PROCESSING - GMP 2006, PROCEEDINGS, 2006, 4077 : 578 - 584
[27] Max-Flow Min-Cut Theorem and Faster Algorithms in a Circular Disk Failure Model
Kobayashi, Yusuke
Otsuki, Kensuke
2014 PROCEEDINGS IEEE INFOCOM, 2014, : 1635 - 1643
[28] A SHORT PROOF OF THE TRUEMPER-TSENG THEOREM ON MAX-FLOW MIN-CUT MATROIDS
BIXBY, RE
RAJAN, A
LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 114 : 277 - 292
[29] iFlow - An Interactive Max-Flow Min-Cut Algorithms Visualizer
Ye, Muyang
Xia, Tianrui
Zu, Tianxin
Wang, Qian
Kempe, David
PROCEEDINGS OF THE 56TH ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION, SIGCSE TS 2025, VOL 1, 2025, : 1288 - 1294
[30] On the max-flow min-cut ratio for directed multicommodity flows
Hajiaghayi, MT
Leighton, T
THEORETICAL COMPUTER SCIENCE, 2006, 352 (1-3) : 318 - 321

← 1 2 3 4 5 →