Brief announcement: Distributed approximation for tree augmentation

DOI10.1145/3087801.3087842zbMATH Open1380.68418OpenAlexW2736824089MaRDI QIDQ5368963FDOQ5368963

Authors: Keren Censor-Hillel, Michal Dory 

Publication date: 11 October 2017

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

Full work available at URL: https://doi.org/10.1145/3087801.3087842

Recommendations

• Fast distributed approximation for TAP and 2-edge-connectivity
• Fast distributed approximation for TAP and 2-edge-connectivity
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
• A fast distributed approximation algorithm for minimum spanning trees
• The distributed minimum spanning tree problem

zbMATH Keywords

approximation algorithmsconnectivity augmentationdistributed network design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cited In (3)

• Fast distributed approximation for TAP and 2-edge-connectivity
• Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
• Fast distributed approximation for TAP and 2-edge-connectivity

This page was built for publication: Brief announcement: Distributed approximation for tree augmentation

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