Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Connectivity and network flows
Handbook of combinatorics (vol. 1)
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Combinatorial optimization
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
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
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
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
Energy-Efficient Wireless Network Design
Theory of Computing Systems
Power optimization for connectivity problems
Mathematical Programming: Series A and B
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
Survivable network design problems in wireless networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Survivable network activation problems
Theoretical Computer Science
| Hi-index | 0.00 |
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present polynomial and improved approximation algorithms, as well as inapproximability results, for some classic network design problems under the power minimization criteria. Our main result is for the problem of finding a min-power subgraph that contains k internally-disjoint vs-paths from every node v to a given node s: we give a polynomial algorithm for directed graphs and a logarithmic approximation algorithm for undirected graphs. In contrast, we will show that the corresponding edge-connectivity problems are unlikely to admit even a polylogarithmic approximation.