Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Routing in communications networks
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Power consumption in packet radio networks
Theoretical Computer Science
Approximation algorithms
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Efficient management of transient station failures in linear radio communication networks with bases
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Hi-index | 0.00 |
Given a set V of n stations, a transmission power cost function c : $V \times V \rightarrowtail {\mathbb R}^{+} \cup {\{+\infty\}}$, an initial power assignment $p_{0} : V \rightarrowtail {\mathbb R}^{+}$, and a connectivity property π, a range augmentation problem consists of finding a minimum power augmentation assignment p such that pf (·) = p0(·) + p(·) satisfies property π. In this paper, we focus on the problem of biconnecting an already existing connected network, to make it resilient to the failure of either a wireless link or a station.For these problems we give a ${\mathcal H}^{2}_{n}$-approximation greedy algorithm (where ${\mathcal H}_{n}$ is the n-th harmonic number) after proving that they are both not approximable within (1 – o(1)) ln n, unless ${\sf NP} \subset {\sf DTIME}(n^{\mathcal{O}({\rm log log} n)})$, even when c is a distance cost function restricted to three power levels, or it is a distance cost function and p0 induces a tree network. Moreover, we prove that both problems remain APX-hard even if the initial power assignment is uniform. In this latter scenario, we finally show that any λ-approximation algorithm for the corresponding problem in wired networks, is a 2λ-approximation algorithm for the wireless case.