Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows

Ruoxu Cen, William He, Jason Li +1

We give an almost-linear time algorithm for the Steiner connectivity augmentation problem: given an undirected graph, find a smallest (or minimum weight) set of edges whose additio…