Parameterized algorithms for power-efficiently connecting wireless sensor networks : theory and experiments
| Year of publication: |
2022
|
|---|---|
| Authors: | Bentert, Matthias ; Van Bevern, René ; Nichterlein, André ; Niedermeier, Rolf ; Smirnov, Pavel |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 1, p. 55-75
|
| Subject: | approximation hardness | color-coding | connected spanning subgraphs | experimental comparison | monitoring areas | parameterization above lower bounds | parameterized complexity analysis | reconnecting sensor networks | Theorie | Theory | Experiment | Algorithmus | Algorithm | Computernetz | Computer network |
-
An optimized ensemble model for predicting average localization error of wireless sensor networks
Nti, Isaac Kofi, (2024)
-
A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks
Zhu, Xiaojun, (2021)
-
Mahak, (2021)
- More ...
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Van Bevern, René, (2017)
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
- More ...