The complexity of symmetric connectivity in directional wireless sensor networks
From MaRDI portal
Publication:2307492
DOI10.1007/s10878-019-00509-8zbMath1441.90144OpenAlexW2993197632WikidataQ126575408 ScholiaQ126575408MaRDI QIDQ2307492
Publication date: 24 March 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00509-8
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)
Related Items (2)
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem ⋮ Improved algorithms in directional wireless sensor networks
Cites Work
- Symmetric connectivity with directional antennas
- Connectivity guarantees for wireless networks with directional antennas
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity
- On dual power assignment optimization for biconnectivity
- Power consumption in packet radio networks
- Euclidean bounded-degree spanning tree ratios
- Energy-efficient wireless network design
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
- On two geometric problems related to the travelling salesman problem
- Minimum bottleneck spanning trees with degree bounds
- Low-Degree Spanning Trees of Small Weight
- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
- Structural Information and Communication Complexity
- Algorithms - ESA 2003
This page was built for publication: The complexity of symmetric connectivity in directional wireless sensor networks
