Optimal cost-sensitive distributed minimum spanning tree algorithm

DOI10.1007/3-540-61422-2_136MaRDI QIDQ5054817zbMATH OpenOpenAlexFDO

Authors Lisa Higham, Teresa Przytycka

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61422-2_136

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• The Steiner problem in distributed computing systems
• Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees
• Asymptotically Optimal Election on Weighted Rings
• A highly asynchronous minimum spanning tree protocol
• The distributed minimum spanning tree problem

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• A highly asynchronous minimum spanning tree protocol
• Asymptotically optimal election on weighted rings
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Optimal distributed algorithm for minimum spanning trees revisited

Cited in

(2)

• Decentralized pricing in minimum cost spanning trees
• The Steiner problem in distributed computing systems

This page was built for publication: Optimal cost-sensitive distributed minimum spanning tree algorithm

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