On minimum power connectivity problems

Authors:
Yuval Lando;Zeev Nutov
Affiliations:
The Open University of Israel, Raanana, Israel;The Open University of Israel, Raanana, Israel
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 12
Cited 3

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
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Combinatorial optimization

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 optimization in fault-tolerant topology control algorithms for wireless multi-hop networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Approximating k-node Connected Subgraphs via Critical Graphs

SIAM Journal on Computing
Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks

Wireless Networks
Energy-Efficient Wireless Network Design

Theory of Computing Systems
Power optimization for connectivity problems

Mathematical Programming: Series A and B
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 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
Approximating minimum-power degree and connectivity problems

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a (directed or undirected) 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 its nodes. Motivated by applications for wireless networks, we present improved approximation algorithms and inapproximability results for some classic network design problems under the power minimization criteria. In particular, we give a logarithmic approximation algorithm for the problem of finding a minpower subgraph that contains k internally-disjoint paths from a given node s to every other node, and show that several other problems are unlikely to admit a polylogarithmic approximation.