Improved distributed steiner forest construction
From MaRDI portal
Publication:2943626
DOI10.1145/2611462.2611464zbMath1321.68481arXiv1405.2011OpenAlexW1983097829MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (6)
Exact Bounds for Distributed Graph Colouring ⋮ Fast Distributed Approximation for TAP and 2-Edge-Connectivity ⋮ Distributed distance computation and routing with small messages ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
This page was built for publication: Improved distributed steiner forest construction
