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 条
  • [41] 2-norm Flow Diffusion in Near-Linear Time
    Chen, Li
    Peng, Richard
    Wang, Di
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 540 - 549
  • [42] A Near-Linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
    Sharathkumar, R.
    Agarwal, Pankaj K.
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 385 - 394
  • [43] Near-linear time approximation schemes for geometric maximum coverage
    Jin, Kai
    Li, Jian
    Wang, Haitao
    Zhang, Bowei
    Zhang, Ningye
    THEORETICAL COMPUTER SCIENCE, 2018, 725 : 64 - 78
  • [44] A Near-Linear Time Sampler for the Ising Model with External Field
    Chen, Xiaoyu
    Zhang, Xinyuan
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 4478 - 4503
  • [45] Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory
    Jambulapati, Arun
    Reis, Victor
    Tian, Kevin
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5169 - 5208
  • [46] Near-linear time Gaussian process optimization with adaptive batching and resparsification
    Calandriello, Daniele
    Carratino, Luigi
    Lazaric, Alessandro
    Valko, Michal
    Rosasco, Lorenzo
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [47] Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
    Kawarabayashi, Ken-ichi
    Thorup, Mikkel
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 665 - 674
  • [48] A Near-Linear Time Algorithm for Constructing a Cactus Representation of Minimum Cuts
    Karger, David R.
    Panigrahi, Debmalya
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 246 - 255
  • [49] Near-linear time Gaussian process optimization with adaptive batching and resparsification
    Calandriello, Daniele
    Carratino, Luigi
    Lazaric, Alessandro
    Valko, Michal
    Rosasco, Lorenzo
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [50] Unified Sample-Optimal Property Estimation in Near-Linear Time
    Hao, Yi
    Orlitsky, Alon
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
12345