Chapter

Integer Programming and Combinatorial Optimization

Volume 3509 of the series Lecture Notes in Computer Science pp 349-361

Power Optimization for Connectivity Problems

  • Mohammad T. HajiaghayiAffiliated withComputer Science and Artificial Intelligence Laboratory, MIT
  • , Guy KortsarzAffiliated withDepartment of Computer Science, Rutgers University-Camden
  • , Vahab S. MirrokniAffiliated withComputer Science and Artificial Intelligence Laboratory, MIT
  • , Zeev NutovAffiliated withComputer Science Division, The Open University of Israel

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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 (MP b-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 (MP k-CSS), Min-Power k -edge Connected Spanning Subgraph problem (MP k-ECSS), and finally the Min-Power k -Edge-Disjoint Paths problem in directed graphs (MP k-EDP). We give an O(log4 n)-approximation algorithm for MP b-EC. This gives an O(log4 n)-approximation algorithm for MP k-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 MP k-ECSS, and for its variant in directed graphs (i.e., MP k-EDP), we establish the following inapproximability threshold: MP k-EDP cannot be approximated within O(2 log 1 − ε n) for any fixed ε > 0, unless NP-hard problems can be solved in quasi-polynomial time.