English

Edge Connectivity Augmentation in Near-Linear Time

Data Structures and Algorithms 2022-05-11 v1
Authors: Ruoxu Cen , Jason Li , Debmalya Panigrahi
View on arXiv ↗ PDF ↗

Abstract

We give an O~(m)\tilde{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.

Keywords

graph algorithm approximation algorithm graph algorithms

Cite

@article{arxiv.2205.04636,
  title  = {Edge Connectivity Augmentation in Near-Linear Time},
  author = {Ruoxu Cen and Jason Li and Debmalya Panigrahi},
  journal= {arXiv preprint arXiv:2205.04636},
  year   = {2022}
}

Comments

To be published in STOC 2022

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Augmenting Edge Connectivity via Isolating Cuts
Ruoxu Cen, Jason Li, Debmalya Panigrahi
2021-11-04
Data Structures and Algorithms · Computer Science
Simple Algorithms for Fully Dynamic Edge Connectivity
Yotam Kenneth-Mordoch, Robert Krauthgamer
2025-10-21
Data Structures and Algorithms · Computer Science
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak +2
2024-03-25
Data Structures and Algorithms · Computer Science
Approximation algorithms for connectivity augmentation problems
Zeev Nutov
2020-11-17
Data Structures and Algorithms · Computer Science
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows
Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi
2022-11-11
Data Structures and Algorithms · Computer Science
A Simple Deterministic Algorithm for Edge Connectivity
Thatchaphol Saranurak
2020-08-20
Data Structures and Algorithms · Computer Science
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
Dániel Marx, László A. Végh
2013-08-27
Computational Geometry · Computer Science
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine +2
2016-12-15
Data Structures and Algorithms · Computer Science
Distributed Edge Connectivity in Sublinear Time
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
2019-04-10
Data Structures and Algorithms · Computer Science
Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back
Aleksander Madry
2013-10-25
Combinatorics · Mathematics
The $(2,k)$-connectivity augmentation problem: Algorithmic aspects
Florian Hörsch, Zoltán Szigeti
2021-04-06
Data Structures and Algorithms · Computer Science
Vertex Connectivity in Poly-logarithmic Max-flows
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak +1
2021-04-12
Data Structures and Algorithms · Computer Science
Optimal decremental connectivity in planar graphs
Jakub Łącki, Piotr Sankowski
2014-09-26
Data Structures and Algorithms · Computer Science
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2021-02-19
Data Structures and Algorithms · Computer Science
Sampling an Edge in Sublinear Time Exactly and Optimally
Talya Eden, Shyam Narayanan, Jakub Tětek
2022-11-15
Data Structures and Algorithms · Computer Science
Engineering Weighted Connectivity Augmentation Algorithms
Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller +1
2024-02-13
Computational Geometry · Computer Science
Compatible Connectivity-Augmentation of Planar Disconnected Graphs
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmović +2
2014-08-12
Social and Information Networks · Computer Science
Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation
Tianyi Li
2022-07-13
Data Structures and Algorithms · Computer Science
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai +2
2020-05-05
Optimization and Control · Mathematics
Upgrading edges in the maximal covering location problem
Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía
2024-09-19
Data Structures and Algorithms · Computer Science
Deterministic Edge Connectivity in Near-Linear Time
Ken-ichi Kawarabayashi, Mikkel Thorup
2018-10-30
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Connected Maximum Cut and Related Problems
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit +1
2015-07-03
Data Structures and Algorithms · Computer Science
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Christopher Johnson, Haitao Wang
2019-04-30
Data Structures and Algorithms · Computer Science
Faster Algorithms for Rooted Connectivity in Directed Graphs
Chandra Chekuri, Kent Quanrud
2021-04-16
Data Structures and Algorithms · Computer Science
Parameterized algorithms for node connectivity augmentation problems
Zeev Nutov
2022-09-15
R2 v1 2026-06-24T11:12:21.529Z