A 4-approximation of the 2 3 -MST

DOI10.1007/978-3-030-83508-8_10MaRDI QIDQ832851zbMATH OpenOpenAlexFDO

Authors Stav Ashur, Matthew J. Katz

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_10

zbMATH Keywords

bounded-angle spanning treebounded-degree spanning treehop-spanner

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• Bounded-angle minimum spanning trees
• Bounded-angle spanning tree: modeling networks with angular constraints
• Connectivity guarantees for wireless networks with directional antennas
• Degree-bounded minimum spanning trees
• Euclidean bounded-degree spanning tree ratios
• Ice-creams and wedge graphs
• Low-Degree Spanning Trees of Small Weight
• Maximizing maximal angles for plane straight-line graphs
• On two geometric problems related to the travelling salesman problem
• Symmetric connectivity with directional antennas
• Transitions in geometric minimum spanning trees

Cited in

(2)

• Bounded-angle minimum spanning trees
• A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST

This page was built for publication: A 4-approximation of the \(\frac{2\pi }{3} \)-MST

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