Bounded-angle minimum spanning trees
From MaRDI portal
Recommendations
- Bounded-angle spanning tree: modeling networks with angular constraints
- Bounded-angle spanning tree: modeling networks with angular constraints
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
- Modeling and solving the angular constrained minimum spanning tree problem
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 3882232 (Why is no real title available?)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST
- Angle-restricted tours in the plane.
- Approximate min-power strong connectivity
- 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
- Degree-bounded minimum spanning trees
- Do directional antennas facilitate in reducing interferences?
- Drawing Hamiltonian cycles with no large angles
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
- Euclidean bounded-degree spanning tree ratios
- Flip distance to some plane configurations
- Ice-creams and wedge graphs
- Low-Degree Spanning Trees of Small Weight
- Maximizing maximal angles for plane straight-line graphs
- Minimizing interference of a wireless ad-hoc network in a plane
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Power consumption in packet radio networks
- 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 Floodlight Problem
- The Min-Max Spanning Tree Problem and some extensions
- Transitions in geometric minimum spanning trees
Cited in
(11)- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- The minimum-area spanning tree problem
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST
- Modeling and solving the angular constrained minimum spanning tree problem
- Approximating average bounded-angle minimum spanning trees
- Acute tours in the plane
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
- Bounded-angle spanning tree: modeling networks with angular constraints
- Bounded-angle spanning tree: modeling networks with angular constraints
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
- A 75 angle constraint for plane minimal T1 trees
This page was built for publication: Bounded-angle minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072102)
