Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Combinatorial optimization
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
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
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.04 |
Given a graph with edge costs, 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. The Minimum-Power Edge-Cover (MPEC) problem is: given a graph G=(V,E) with edge costs {c(e):e@?E} and a subset S@?V of nodes, find a minimum-power subgraph H of G containing an edge incident to every node in S. We give a 3/2-approximation algorithm for MPEC, improving over the 2-approximation by [M.T. Hajiaghayi, G. Kortsarz, V.S. Mirrokni, Z. Nutov, Power optimization for connectivity problems, Mathematical Programming 110 (1) (2007) 195-208]. For the Min-Powerk-Connected Subgraph (MPkCS) problem we obtain the following results. For k=2 and k=3, we improve the previously best known ratios of 4 [G. Calinescu, P.J. Wan, Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks, Mobile Networks and Applications 11 (2) (2006) 121-128] and 7 [M.T. Hajiaghayi, G. Kortsarz, V.S. Mirrokni, Z. Nutov, Power optimization for connectivity problems, Mathematical Programming 110 (1) (2007) 195-208] to 323 and 523, respectively. Finally, we give a 4r"m"a"x-approximation algorithm for the 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.