A 4-approximation of the \(\frac{2\pi }{3} \)-MST

DOI10.1007/978-3-030-83508-8_10OpenAlexW3197542580MaRDI QIDQ832851

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-degree spanning treehop-spannerbounded-angle spanning tree

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

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

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