Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Combinatorial optimization
The budgeted maximum coverage problem
Information Processing Letters
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
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
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Symmetric range assignment with disjoint MST constraints
Proceedings of the fifth international workshop on Foundations of mobile computing
Approximating Minimum-Power k-Connectivity
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics
Wireless network design via 3-decompositions
Information Processing Letters
On minimum power connectivity problems
Journal of Discrete Algorithms
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating survivable networks with minimum number of Steiner points
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.01 |
Power optimization is a central issue in wireless network design. Given a (possibly directed) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider several fundamental undirected network design problems under the power minimization criteria. Given a graph G = (V, E) with edge costs {ce : e ∈ E} and degree requirements {r(v) : v ∈ V}, the Minimum-Power Edge-Multi-Cover (MPEMC) problem is to find a minimum-power subgraph of G so that the degree of every node v is at least r(v). We give an O(log n)-approximation algorithms for MPEMC, improving the previous ratio O(log4 n) of [11]. This is used to derive an O(log n+α)-approximation algorithm for the undirected Minimum-Power k-Connected Subgraph (MPk-CS) problem, where α is the best known ratio for the min-cost variant of the problem (currently, α = O(ln k) for n ≥ 2k2 and α = O(ln2 k ċ min{n/n-k, √k/log n}) otherwise). Surprisingly, it shows that the min-power and the min-cost versions of the k-Connected Subgraph problem are equivalent with respect to approximation, unless the min-cost variant admits an o(log n)-approximation, which seems to be out of reach at the moment. We also improve the best known approximation ratios for small requirements. Specifically, we give a 3/2-approximation algorithm for MPEMC with r(v) ∈ {0, 1}, improving over the 2-approximation by [11], and a 3 2/3-approximation for the minimum-power 2-Connected and 2-Edge-Connected Subgraph problems, improving the 4-approximation by [4]. Finally, we give a 4rmax-approximation algorithm for the undirected Minimum-Power Steiner Network (MPSN) problem: find a minimum-power subgraph that contains r(u, v) pairwise edge-disjoint paths for every pair u, v of nodes.