Edge Connectivity Augmentation in Near-Linear Time

Abstract

We give an $\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.

arXiv commentTo be published in STOC 2022