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}
}
  • Michal Dory
  • Published 2018
  • Computer Science, Mathematics
  • Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
  • 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
    Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
    • 8
    • PDF
    Distributed Spanner Approximation
    • 13
    • PDF
    On Packing Low-Diameter Spanning Trees
    • 1
    • PDF
    Fast distributed approximation for TAP and 2-edge-connectivity
    • 4
    • PDF
    Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
    • 8
    • PDF
    Fast Distributed Approximation for TAP and 2-Edge-Connectivity
    • 5
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Fast Distributed Construction of Small k-Dominating Sets and Applications
    • 207
    • Highly Influential
    Distributed primal-dual approximation algorithms for network design problems
    • 4
    • Highly Influential
    • PDF
    Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
    • 13
    • Highly Influential
    • PDF
    Fast computation of small cuts via cycle space sampling
    • 23
    • Highly Influential
    • PDF
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
    • 152
    • Highly Influential
    • PDF
    Distributed Approximation of Minimum k -edge-connected Spanning Subgraphs
    • 2018
    Distributed Computing: A Locality-Sensitive Approach
    • 849
    • Highly Influential