Bounded-angle spanning tree: modeling networks with angular constraints
approximation algorithmsdirectional antennashop spannerminimum spanning treeNP-hardnesspower assignmentwireless networks
Graph representations (geometric and intersection representations, etc.) (05C62) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
- Bounded-angle spanning tree: modeling networks with angular constraints
- Bounded-angle minimum spanning trees
- 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
- Angle-restricted tours in the plane.
- Bounded-angle spanning tree: modeling networks with angular constraints
- Connectivity guarantees for wireless networks with directional antennas
- Connectivity with directional antennas in the symmetric communication model
- Degree-bounded minimum spanning trees
- Drawing Hamiltonian cycles with no large angles
- Euclidean bounded-degree spanning tree ratios
- Geometry helps in bottleneck matching and related problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Hamilton Paths in Grid Graphs
- Ice-creams and wedge graphs
- Low-Degree Spanning Trees of Small Weight
- Maintaining connectivity in sensor networks using directional antennae
- Maximizing maximal angles for plane straight-line graphs
- Min-power strong connectivity
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity
- On two geometric problems related to the travelling salesman problem
- Paths with no small angles
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Power consumption in packet radio networks
- Switching to directional antennas with constant increase in radius and hop distance
- Symmetric connectivity with directional antennas
- A 75 angle constraint for plane minimal T1 trees
- Game of operation of a telecommunication network of agents with directional antennas
- A unifying model for locally constrained spanning tree problems
- Bounded-angle minimum spanning trees
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
- Modeling and solving the angular constrained minimum spanning tree problem
- Coverage restricted to an angle
- Minimum scan cover with angular transition costs
- Game of operation of a telecommunication network of agents with directional antennae
- Bounded-angle spanning tree: modeling networks with angular constraints
- Improved algorithms in directional wireless sensor networks
- On solving bi-objective constrained minimum spanning tree problems
- Acute tours in the plane
- Approximating average bounded-angle minimum spanning trees
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST
This page was built for publication: Bounded-angle spanning tree: modeling networks with angular constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513267)
