Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

DOI10.1145/3212734.3212760zbMath1428.68370arXiv1805.07764OpenAlexW2803918337MaRDI QIDQ5197676

Michal Dory

Publication date: 19 September 2019

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (3)

A distributed algorithm for directed minimum-weight spanning tree ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Distributed Spanner Approximation

This page was built for publication: Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs