A faster strongly polynomial minimum cost flow algorithm
Operations Research
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
SIAM Journal on Computing
Fast algorithms for k-shredders and k-node connectivity augmentation
Journal of Algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
On the Symmetric Range Assignment Problem in Wireless Ad Hoc 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
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
Approximation algorithm for k-node connected subgraphs via critical graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
k-fault resistance in wireless ad-hoc networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Power efficient resilience and lifetime in wireless ad-hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
Low-energy fault-tolerant bounded-hop broadcast in wireless networks
IEEE/ACM Transactions on Networking (TON)
On minimizing the total power of k-strongly connected wireless networks
Wireless Networks
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
| Hi-index | 0.00 |
Given a graph with costs on the edges, 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 the nodes of this graph. Motivated by applications in wireless multi-hop networks, we consider four fundamental problems under the power minimization criteria: the Min-Power b-Edge-Cover problem (MPb-EC) where the goal is to find a min-power subgraph so that the degree of every node v is at least some given integer b(v), the Min-Power k-node Connected Spanning Subgraph problem (MPk-CSS), Min-Power k-edge Connected Spanning Subgraph problem (MPk-ECSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP). We give an O(log4n)-approximation algorithm for MPb-EC. This gives an O(log4n)-approximation algorithm for MPk-CSS for most values of k, improving the best previously known O(k)-approximation guarantee. In contrast, we obtain an $O(\sqrt{n})$ approximation algorithm for MPk-ECSS, and for its variant in directed graphs (i.e., MPk-EDP), we establish the following inapproximability threshold: MPk-EDP cannot be approximated within O(2log1−εn) for any fixed ε 0, unless NP-hard problems can be solved in quasi-polynomial time.