A survey on relay placement with runtime and approximation guarantees
DOI10.1016/J.COSREV.2010.09.005zbMATH Open1298.68292OpenAlexW2027533686MaRDI QIDQ465673FDOQ465673
Authors: Bastian Degener, Sándor P. Fekete, Barbara Kempkes, Friedhelm Meyer auf der Heide 
Publication date: 24 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2010.09.005
Recommendations
- Improved Approximation Algorithms for Relay Placement
- Improved Approximation Algorithms for Relay Placement
- Improved approximation algorithms for single-tiered relay placement
- SOFSEM 2006: Theory and Practice of Computer Science
- Relays: a new approach for the finite departure problem in overlay networks
- Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
- scientific article; zbMATH DE number 1688370
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40) Distributed systems (68M14)
Cites Work
- Improved Approximation Algorithms for Relay Placement
- Relay Node Placement in Wireless Sensor Networks
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Approximations for Steiner trees with minimum number of Steiner points
- Minimum Spanning Tree with Neighborhoods
- Impossibility of gathering by a set of autonomous mobile robots
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- A continuous, local strategy for constructing a short chain of mobile robots
- Energy-efficient strategies for building short chains of mobile robots locally
- Fault-tolerant gathering algorithms for autonomous mobile robots
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Approximations for Steiner trees with minimum number of Steiner points
Cited In (6)
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas
- Optimal placement of UV-based communications relay nodes
- Exploring and triangulating a region by a swarm of robots
- Relays: a new approach for the finite departure problem in overlay networks
- Improved Approximation Algorithms for Relay Placement
This page was built for publication: A survey on relay placement with runtime and approximation guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465673)
