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 条
  • [41] IMPROVED BOUNDS ON THE MAX-FLOW MIN-CUT RATIO FOR MULTICOMMODITY FLOWS
    PLOTKIN, S
    TARDOS, V
    COMBINATORICA, 1995, 15 (03) : 425 - 434
  • [42] End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers
    Alzaben, Nada
    Engels, Daniel W.
    2022 24TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT): ARITIFLCIAL INTELLIGENCE TECHNOLOGIES TOWARD CYBERSECURITY, 2022, : 1405 - 1413
  • [43] Max-Flow Min-Cut for Power System Security Index Computation
    Kosut, Oliver
    2014 IEEE 8TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2014, : 61 - 64
  • [44] PMUs Placement with Max-Flow Min-Cut Communication Constraint in Smart Grids
    Gaber, Ali
    Seddik, Karim G.
    Elezabi, Ayman Y.
    2016 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, 2016,
  • [45] Min-Cut Max-Flow for Network Abnormality Detection: Application to Preterm Birth
    Irzan, Hassna
    Fidon, Lucas
    Vercauteren, Tom
    Ourselin, Sebastien
    Marlow, Neil
    Melbourne, Andrew
    UNCERTAINTY FOR SAFE UTILIZATION OF MACHINE LEARNING IN MEDICAL IMAGING, AND GRAPHS IN BIOMEDICAL IMAGE ANALYSIS, UNSURE 2020, GRAIL 2020, 2020, 12443 : 164 - 173
  • [46] Examples of max-flow and min-cut problems with duality gaps in continuous networks
    Nozawa, Ryohei
    Mathematical Programming, Series B, 1994, 63 (02): : 213 - 234
  • [47] EXAMPLES OF MAX-FLOW AND MIN-CUT PROBLEMS WITH DUALITY GAPS IN CONTINUOUS NETWORKS
    NOZAWA, R
    MATHEMATICAL PROGRAMMING, 1994, 63 (02) : 213 - 234
  • [48] ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS
    NAGAMOCHI, H
    IBARAKI, T
    INFORMATION PROCESSING LETTERS, 1989, 31 (06) : 279 - 285
  • [49] Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision
    Jensen, Patrick M. M.
    Jeppesen, Niels
    Dahl, Anders B. B.
    Dahl, Vedrana A. A.
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (02) : 2310 - 2329
  • [50] Finding Better Web Communities in Digraphs via Max-Flow Min-Cut
    Chan, Chung
    Al-Bashabsheh, Ali
    Tam, Da Sun Handason
    Zhao, Chao
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 410 - 414
12345