Edge Connectivity Augmentation in Near-Linear Time

被引：2
|
作者：
Cen, Ruoxu [1 ]
Li, Jason [2 ]
Panigrahi, Debmalya [1 ]
机构：
[1] Duke Univ, Dept Comp Sci, Durham, NC 27706 USA
[2] Univ Calif Berkeley, Simons Inst Theory Comp, Berkeley, CA 94720 USA
来源：
PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22) | 2022年
关键词：
connectivity augmentation; splitting off; extreme sets; minimu cuts; ALGORITHM; CUT;
D O I：
10.1145/3519935.3520038
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give an O (m)-time algorithm for the edge connectivity augmentation problem and the closely related edge splitting-off problem. This is optimal up to lower order terms and closes the long line of work on these problems.
引用
收藏
页码：137 / 150
页数：14
相关论文
共 50 条
  • [1] Deterministic Edge Connectivity in Near-Linear Time
    Kawarabayashi, Ken-Ichi
    Thorup, Mikkel
    JOURNAL OF THE ACM, 2019, 66 (01)
  • [2] Constant-Factor Approximation of Near-Linear Edit Distance in Near-Linear Time For
    Brakensiek, Joshua
    Rubinstein, Aviad
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 685 - 698
  • [3] Minimum cuts in near-linear time
    Karger, DR
    JOURNAL OF THE ACM, 2000, 47 (01) : 46 - 76
  • [4] Approximating Partition in Near-Linear Time
    Chen, Lin
    Lian, Jiayi
    Mao, Yuchen
    Zhang, Guochuan
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 307 - 318
  • [5] Near-optimal pricing in near-linear time
    Hartline, JD
    Koltun, V
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 422 - 431
  • [6] Approximating Edit Distance in Near-Linear Time
    Andoni, Alexandr
    Onak, Krzysztof
    STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 199 - 204
  • [7] A Near-Linear Time Algorithm for the Chamfer Distance
    Bakshi, Ainesh
    Indyk, Piotr
    Jayaram, Rajesh
    Silwal, Sandeep
    Waingarten, Erik
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [8] APPROXIMATING EDIT DISTANCE IN NEAR-LINEAR TIME
    Andoni, Alexandr
    Onak, Krzysztof
    SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1635 - 1648
  • [9] Rate-Distortion in Near-Linear Time
    Gupta, Ankit
    Verdu, Sergio
    Weissman, Tsachy
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 847 - +
  • [10] Consensus Spectral Clustering in Near-Linear Time
    Luo, Dijun
    Ding, Chris
    Huang, Heng
    Nie, Feiping
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 1079 - 1090
12345