Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

Abstract

In the minimum k-edge-connected spanning subgraph (k-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to k-1 edge failures. This is a central problem in network design, and a natural generalization of the minimum spanning tree (MST) problem. While the MST problem has been studied extensively by the distributed computing community, for k ≥2 less is known in the distributed setting.