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

DOI10.1145/3293611.3331617OpenAlexW2963355678WikidataQ130863703 ScholiaQ130863703MaRDI QIDQ5145264

Mohsen Ghaffari, Michal Dory

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (2)

Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Finding a small vertex cut on distributed networks

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