The (2,k)-connectivity augmentation problem: Algorithmic aspects

04/18/2020

∙

by   Florian Hoersch, et al.

∙

Grenoble Institute of Technology

∙

0

∙

share

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theorem for the (2,k)-connectivity augmentation problem. This article provides an O(n^3(m+ n logn)) algorithm to find an optimal solution for this problem.