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

DOI10.1145/3293611.3331617OpenAlexW2963355678WikidataQ130863703 ScholiaQ130863703MaRDI QIDQ5145264FDOQ5145264

Authors: Michal Dory, Mohsen Ghaffari 

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.10833

Recommendations

• Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• Finding 2-edge connected spanning subgraphs.
• scientific article; zbMATH DE number 1187147
• Fast distributed approximation for TAP and 2-edge-connectivity

zbMATH Keywords

approximation algorithms\(k\)-edge-connectivitydistributed graph algorithmsdistributed network design

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (4)

• Fast distributed approximation for TAP and 2-edge-connectivity
• Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
• Finding a small vertex cut on distributed networks
• A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms

This page was built for publication: Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145264)