Approximating average bounded-angle minimum spanning trees

DOI10.1016/J.COMGEO.2025.102172MaRDI QIDQ7015114zbMATH OpenFDO

Authors Ahmad Biniaz, Prosenjit Bose, Patrick Devaney

Publication date 10 March 2025

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsdirectional antennabounded-angle MSTaverage bounded-angle MST

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Approximation algorithms (68W25)

Cites work

• A 10-approximation of the \(\frac{\pi}{2}\)-MST
• A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
• Bounded-angle minimum spanning trees
• Bounded-angle spanning tree: modeling networks with angular constraints
• Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
• Connectivity guarantees for wireless networks with directional antennas
• Do directional antennas facilitate in reducing interferences?
• Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
• Euclidean bounded-degree spanning tree ratios
• Ice-creams and wedge graphs
• Low-Degree Spanning Trees of Small Weight
• Minimizing interference of a wireless ad-hoc network in a plane
• Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
• STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE
• Spanning properties of graphs induced by directional antennas
• Switching to directional antennas with constant increase in radius and hop distance
• Symmetric connectivity with directional antennas
• The Min-Max Spanning Tree Problem and some extensions
• Transitions in geometric minimum spanning trees

This page was built for publication: Approximating average bounded-angle minimum spanning trees

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