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 条
  • [31] Extending Partial Representations of Circle Graphs in Near-Linear Time
    Brueckner, Guido
    Rutter, Ignaz
    Stumpf, Peter
    ALGORITHMICA, 2024, 86 (07) : 2152 - 2173
  • [32] Large-scale Collaborative Ranking in Near-Linear Time
    Wu, Liwei
    Hsieh, Cho-Jui
    Sharpnack, James
    KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 515 - 524
  • [33] Edit Distance in Near-Linear Time: it's a Constant Factor
    Andoni, Alexandr
    Nosatzki, Negev Shekel
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 990 - 1001
  • [34] Near-linear time approximations schemes for clustering in doubling metrics
    Cohen-Addad, Vincent
    Feldmann, Andreas Emil
    Saulpic, David
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 540 - 559
  • [35] Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
    Cohen-Addad, Vincent
    Feldmann, Andreas Emil
    Saulpic, David
    JOURNAL OF THE ACM, 2021, 68 (06)
  • [36] Constant Approximation of Min-Distances in Near-Linear Time
    Chechik, Shiri
    Zhang, Tianyi
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 896 - 906
  • [37] The Dyck Language Edit Distance Problem in Near-linear Time
    Saha, Barna
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 611 - 620
  • [38] Finding the KT Partition of a Weighted Graph in Near-Linear Time
    Apers, Simon
    Gawrychowski, Pawel
    Lee, Troy
    Leibniz International Proceedings in Informatics, LIPIcs, 2022, 245
  • [39] A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees
    Doan, Duong D.
    Evans, Patricia A.
    Horton, Joseph D.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2010, 17 (10) : 1451 - 1465
  • [40] A deterministic near-linear time approximation scheme for geometric transportation
    Fox, Emily
    Lu, Jiashuai
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 1301 - 1315
12345