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 |
-
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Montemanni, Roberto, (2011)
-
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Behdani, Behnam, (2012)
-
Randomized truthful mechanisms for scheduling unrelated machines
Lu, Pinyan, (2008)
- More ...
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Constant-factor approximations for capacitated arc routing without triangle inequality
Van Bevern, René, (2014)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
- More ...