Improved distributed steiner forest construction
From MaRDI portal
Publication:2943626
DOI10.1145/2611462.2611464zbMath1321.68481arXiv1405.2011MaRDI QIDQ2943626
Boaz Patt-Shamir, Christoph Lenzen
Publication date: 3 September 2015
Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.2011
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree, Fast distributed approximation for TAP and 2-edge-connectivity, Fooling views: a new lower bound technique for distributed computations under congestion, Distributed distance computation and routing with small messages, Exact Bounds for Distributed Graph Colouring, Fast Distributed Approximation for TAP and 2-Edge-Connectivity