Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
Matthias Bentert, Ren\'e van Bevern, Andr\'e Nichterlein and, Rolf Niedermeier, Pavel V. Smirnov

TL;DR
This paper investigates the complexity of energy-efficient connectivity in wireless sensor networks, establishing hardness results and providing algorithms that outperform existing methods in large-scale scenarios.
Contribution
It introduces new complexity results for the problem and offers a polynomial-time algorithm for reconnecting multiple components efficiently.
Findings
Hardness of approximation within o(log n) for the problem.
No subexponential algorithms under ETH for exact solutions.
Proposed polynomial-time algorithm effectively reconnects multiple components.
Abstract
We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted -vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. On the negative side, we show that -approximating the difference between the optimal solution cost and a natural lower bound is NP-hard and that, under the Exponential Time Hypothesis, there are no exact algorithms running in time or in time for any computable function . Moreover, we show that the special case of connecting network components with minimum additional cost generally cannot be polynomial-time reduced to instances of size unless the polynomial-time hierarchy collapses. On the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
