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 条

[31] 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 2, 2025, : 1288 - 1294
[32] SOME GENERALIZED MAX-FLOW MIN-CUT PROBLEMS IN THE PLANE
BIENSTOCK, D
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (02) : 310 - 333
[33] Some generalized max-flow min-cut problems in the plane
1600, (16):
[34] A new min-cut max-flow ratio for multicommodity flows
Gunluk, Oktay
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) : 1 - 15
[35] A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory
Lochbihler, Andreas
JOURNAL OF AUTOMATED REASONING, 2022, 66 (04) : 585 - 610
[36] A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory
Andreas Lochbihler
Journal of Automated Reasoning, 2022, 66 : 585 - 610
[37] The max-flow min-cut property and ±1-resistant sets
Abdi, Ahmad
Cornuejols, Gerard
DISCRETE APPLIED MATHEMATICS, 2021, 289 : 455 - 476
[38] Phase unwrapping: A new max-flow/min-cut based approach
Bioucas-Dias, JM
Valadao, G
2005 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), VOLS 1-5, 2005, : 2077 - 2080
[39] Petri Nets Based Max-flow/Min-cut Modeling and Analyzing
Zou, Zheng
Liu, Shi-Jian
Pan, Jeng-Shyang
JOURNAL OF INTERNET TECHNOLOGY, 2020, 21 (04): : 919 - 928
[40] Matrix product states and the quantum max-flow/min-cut conjectures
Gesmundo, Fulvio
Landsberg, J. M.
Walter, Michael
JOURNAL OF MATHEMATICAL PHYSICS, 2018, 59 (10)

← 1 2 3 4 5 →