Approximating k-node Connected Subgraphs via Critical Graphs
SIAM Journal on Computing
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
Power optimization for connectivity problems
Mathematical Programming: Series A and B
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Inapproximability of Survivable Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating minimum-power degree and connectivity problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximating minimum power covers of intersecting families and directed connectivity problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Dual band connectivity of cognitive radio networks
Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
The Minimum-Powerk-Connected Subgraph(MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that significantly improves the previously best known approximation ratios. Specifically, the approximation ratios of our algorithm are:3 (improving (3 + 2/3)) for k= 2,4 (improving (5 + 2/3)) for k= 3,k+ 3 for k驴 {4,5} and k+ 5 for k驴 {6,7} (improving k+ 2驴(k+ 1)/2驴),3(k驴 1) (improving 3k) for any constant k.Our results are based on a (k+ 1)-approximation algorithm (improving the ratio k+ 4) for the problem of finding a Min-Powerk-Inconnected Subgraph, which is of independent interest.