# Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

@article{Dory2018DistributedAO, title={Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs}, author={Michal Dory}, journal={Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing}, year={2018} }

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. In this paper, we present fast randomized distributed approximation algorithms for k… CONTINUE READING

8 Citations

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph

- Computer Science, Mathematics
- 2019

- 8
- PDF

Small Cuts and Connectivity Certificates: A Fault Tolerant Approach

- Computer Science, Mathematics
- 2019

- 8
- PDF

Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics

- Computer Science, Mathematics
- 2019

- 7
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-7 OF 7 REFERENCES

Fast Distributed Construction of Small k-Dominating Sets and Applications

- Computer Science, Mathematics
- 1998

- 207
- Highly Influential

Distributed primal-dual approximation algorithms for network design problems

- 2008

- 4
- Highly Influential
- PDF

Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures

- Computer Science
- 2016

- 13
- Highly Influential
- PDF

Fast computation of small cuts via cycle space sampling

- Mathematics, Computer Science
- 2011

- 23
- Highly Influential
- PDF

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

- Computer Science, Mathematics
- 1998

- 152
- Highly Influential
- PDF

Distributed Approximation of Minimum k -edge-connected Spanning Subgraphs

- 2018