Bounded-angle spanning tree: modeling networks with angular constraints
type: Item
instance of: scholarly article
title: Bounded-angle spanning tree: modeling networks with angular constraints
zbMATH Open document ID: 1359.68229
author: Rom Aschner
author: Matthew J. Katz
published in: Algorithmica
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6691856
zbMATH Keywords: wireless networks
zbMATH Keywords: directional antennas
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: approximation algorithms
zbMATH Keywords: NP-hardness
zbMATH Keywords: hop spanner
zbMATH Keywords: power assignment
MaRDI profile type: Publication
full work available at URL: s00453-015-0076-9
OpenAlex ID: W1833772674
cites work: Ice-creams and wedge graphs
cites work: Maximizing maximal angles for plane straight-line graphs
cites work: Not being (super)thin or solid is hard: A study of grid Hamiltonicity
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
cites work: Symmetric connectivity with directional antennas
cites work: Paths with No Small Angles
cites work: Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
cites work: Min-Power Strong Connectivity
cites work: Drawing Hamiltonian cycles with no large angles
cites work: Connectivity guarantees for wireless networks with directional antennas
cites work: Euclidean bounded-degree spanning tree ratios
cites work: Connectivity with directional antennas in the symmetric communication model
cites work: Geometry helps in bottleneck matching and related problems
cites work: Angle-restricted tours in the plane.
cites work: Hamilton Paths in Grid Graphs
cites work: Degree-bounded minimum spanning trees
cites work: Low-Degree Spanning Trees of Small Weight
cites work: Power consumption in packet radio networks
cites work: Maintaining Connectivity in Sensor Networks Using Directional Antennae
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: On two geometric problems related to the travelling salesman problem
DOI: 10.1007/S00453-015-0076-9
description: scientific article; zbMATH DE number 6691856