Jun 10, 2017 · Abstract:We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication ...

Jun 3, 2021 · We study a problem of energy-efficiently connecting a symmetric wireless communication network: given an n-vertex graph with edge weights, ...

Oct 22, 2024 · These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several ...

These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several connected components.

These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several connected components ...

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments · M. Bentert, René van Bevern, +2 authors. P. Smirnov ...

These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several connected components ...

In experiments, the algorithm outperforms CPLEX with known integer linear programming (ILP) formulations when n is sufficiently large compared with c. AB - We ...

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. From MaRDI portal. Publication:5084628.

Oct 22, 2024 · We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless ...