Approximating Minimum Power Edge-Multi-Covers

  • Nachshon Cohen
  • Zeev Nutov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7353)


Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph G = (V,E) with edge costs and degree bounds {r(v):v ∈ V}, the Minimum-Power Edge-Multi-Cover (MPEMC) problem is to find a minimum-power subgraph J of G such that the degree of every node v in J is at least r(v). Let k =  max v ∈ V r(v). For k = Ω(logn), the previous best approximation ratio for MPEMC was O(logn), even for uniform costs [3]. Our main result improves this ratio to O(logk) for general costs, and to O(1) for uniform costs. This also implies ratios O(logk) for the Minimum-Power k -Outconnected Subgraph and \(O\left(\log k \log \frac{n}{n-k} \right)\) for the Minimum-Power k -Connected Subgraph problems; the latter is the currently best known ratio for the min-cost version of the problem. In addition, for small values of k, we improve the previously best ratio k + 1 to k + 1/2.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks. Wireless Networks 12(3), 287–299 (2006)CrossRefGoogle Scholar
  2. 2.
    Hajiaghayi, M., Kortsarz, G., Mirrokni, V., Nutov, Z.: Power optimization for connectivity problems. Math. Programming 110(1), 195–208 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Kortsarz, G., Mirrokni, V., Nutov, Z., Tsanko, E.: Approximating minimum-power degree and connectivity problems. Algorithmica 58 (2010)Google Scholar
  4. 4.
    Kortsarz, G., Nutov, Z.: Approximating minimum-power edge-covers and 2,3-connectivity. Discrete Applied Mathematics 157, 1840–1847 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Lando, Y., Nutov, Z.: On minimum power connectivity problems. J. of Discrete Algorithms 8(2), 164–173 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Mathematics 23(4), 2053–2078 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Nutov, Z.: An almost O(logk)-approximation for k-connected subgraphs. In: SODA, pp. 912–921 (2009)Google Scholar
  8. 8.
    Nutov, Z.: Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theoretical Computer Science 411(26-28), 2502–2512 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Nutov, Z.: Approximating minimum power k-connectivity. Ad Hoc & Sensor Wireless Networks 9(1-2), 129–137 (2010)Google Scholar
  10. 10.
    Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Nachshon Cohen
    • 1
  • Zeev Nutov
    • 1
  1. 1.The Open University of IsraelIsrael

Personalised recommendations