A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs

DOI10.1007/978-3-642-03409-1_22MaRDI QIDQ3183615zbMATH OpenOpenAlexFDO

Authors Krzysztof Krzywdziński

Publication date 20 October 2009

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03409-1_22

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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 fast distributed approximation algorithm for minimum spanning trees
• Distributed Approximation Algorithms in Unit-Disk Graphs
• Approximate MST for UDG locally

Cited in

(2)

• Approximate MST for UDG locally
• Distributed MST for constant diameter graphs

This page was built for publication: A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs

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