Approximate MST for UDG locally

DOI10.1007/3-540-45071-8_37MaRDI QIDQ3082943zbMATH OpenOpenAlexFDO

Authors Xiangyang Li

Publication date 18 March 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45071-8_37

Mathematics Subject Classification ID

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

Recommendations

• A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Degree-bounded minimum spanning tree for unit disk graph
• Computing Lightweight Spanners Locally
• The “real” approximation factor of the MST heuristic for the minimum energy broadcasting

Cited in

(6)

• Local solutions for global problems in wireless networks
• A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
• The MST of symmetric disk graphs is light
• Communication costs in a geometric communication network
• Local MST computation with short advice
• Some problems in distributed computational geometry

This page was built for publication: Approximate MST for UDG locally

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