Power optimization for connectivity problems

• 成果类型: Article; Proceedings Paper
• 署名作者: Hajiaghayi, Mohammad T.; Kortsarz, Guy; Mirrokni, Vahab S.; Nutov, Zeev
• 署名单位: Massachusetts Institute of Technology (MIT); Rutgers University System; Rutgers University New Brunswick; Rutgers University Camden; Microsoft; Open University Israel
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-006-0057-5
• 发表日期: 2007
• 页码: 195-208
• 关键词: Approximation; algorithms

摘要

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 multihop 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 amin-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(log(4) n)-approximation algorithm for MPb-EC. This gives an O(log(4) 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(root 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(2log(1-epsilon) n) for any fixed epsilon > 0, unless NP-hard problems can be solved in quasi-polynomial time.