A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

DOI10.1007/11864219_25MaRDI QIDQ3524318zbMATH OpenOpenAlexFDO

Authors Maleq Khan, Gopal Pandurangan

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_25

zbMATH Keywords

distributed approximation algorithmminimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• A fast distributed approximation algorithm for minimum spanning trees
• A faster distributed protocol for constructing a minimum spanning tree
• A faster distributed protocol for constructing a minimum spanning tree

Cited in

(22)

• A fast distributed approximation algorithm for minimum spanning trees
• A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
• An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
• Faster Fully-Dynamic Minimum Spanning Forest
• Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
• scientific article; zbMATH DE number 1304097 (Why is no real title available?)
• A distributed approximation algorithm for the minimum degree minimum weight spanning trees
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• scientific article; zbMATH DE number 1756011 (Why is no real title available?)
• Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
• A linear-time optimal-message distributed algorithm for minimum spanning trees
• Distributed Minimum Degree Spanning Trees
• Brief announcement: Distributed approximation for tree augmentation
• Distributed approximation of minimum routing cost trees
• A faster distributed protocol for constructing a minimum spanning tree
• Computing and Combinatorics
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• Distributed algorithms for low stretch spanning trees
• Silent MST Approximation for Tiny Memory
• Energy-efficient cooperative data aggregation for wireless sensor networks
• A faster distributed protocol for constructing a minimum spanning tree

This page was built for publication: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

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