TY - JOUR

T1 - Power optimization for connectivity problems

AU - Hajiaghayi, Mohammad T.

AU - Kortsarz, Guy

AU - Mirrokni, Vahab S.

AU - Nutov, Zeev

PY - 2007/6

Y1 - 2007/6

N2 - 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-CSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP). We give an O(log4 n)-approximation algorithm for MPb-EC. This gives an O(log4 n)-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(√n) approximation algorithm for 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(2 log1-ε n) for any fixed ε > 0, unless NP-hard problems can be solved in quasi-polynomial time.

AB - 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-CSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP). We give an O(log4 n)-approximation algorithm for MPb-EC. This gives an O(log4 n)-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(√n) approximation algorithm for 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(2 log1-ε n) for any fixed ε > 0, unless NP-hard problems can be solved in quasi-polynomial time.

UR - http://www.scopus.com/inward/record.url?scp=33947184941&partnerID=8YFLogxK

U2 - 10.1007/s10107-006-0057-5

DO - 10.1007/s10107-006-0057-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33947184941

SN - 0025-5610

VL - 110

SP - 195

EP - 208

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -