Skip to main content
SpringerLink
Log in

Improved Approximation Algorithms for Minimum Power Covering Problems

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11312))

Included in the following conference series:

Abstract

Given an undirected 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 two network design problems under the power minimization criteria. In both problems we are given a graph \(G=(V,E)\) with edge costs and a set \(T \subseteq V\) of terminals. The goal is to find a minimum power edge subset \(F \subseteq E\) such that the graph \(H=(V,F)\) satisfies some prescribed requirements. In the Min-Power Edge-Cover problem, H should contain an edge incident to every terminal. Using the Iterative Randomized Rounding (IRR) method, we give an algorithm with expected approximation ratio 1.41; the ratio is reduced to \(73/60<1.217\) when T is an independent set in G. In the case of unit costs we also achieve ratio 73 / 60, and in addition give a simple efficient combinatorial algorithm with ratio 5 / 4. For all these NP-hard problems the previous best known ratio was 3 / 2. In the related Min-Power Terminal Backup problem, H should contain a path from every \(t \in T\) to some node in \(T \setminus \{t\}\). We obtain ratio 3 / 2 for this NP-hard problem, improving the trivial ratio of 2.

Partially supported by NSF grant number 1540547.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Althaus, E., Calinescu, G., Mandoiu, I., Prasad, S., Tchervenski, N., Zelikovksy, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wirel. Netw. 12(3), 287–299 (2006)

    Article  Google Scholar 

  2. Anshelevich, E., Karagiozova, A.: Terminal backup, 3D matching, and covering cubic graphs. SIAM J. Comput. 40(3), 678–708 (2011)

    Article  MathSciNet  Google Scholar 

  3. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1–6:33 (2013)

    Article  MathSciNet  Google Scholar 

  4. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39658-1_13

    Chapter  Google Scholar 

  5. Calinescu, G., Wan, P.J.: Range assignment for biconnectivity and \(k\)-edge connectivity in wireless ad hoc networks. Mob. Netw. Appl. 11(2), 121–128 (2006)

    Article  Google Scholar 

  6. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-efficient wireless network design. Theory Comput. Syst. 39(5), 593–617 (2006)

    Article  MathSciNet  Google Scholar 

  7. Chen, W., Huang, N.: The strongly connecting problem on multi-hop packet radio networks. IEEE Trans. Commun. 37(3), 293–295 (1989)

    Article  Google Scholar 

  8. Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX/RANDOM -1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48413-4_21

    Chapter  Google Scholar 

  9. Clementi, A.E.F., Penna, P., Silvestri, R.: The power range assignment problem in radio networks on the plane. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 651–660. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-46541-3_54

    Chapter  Google Scholar 

  10. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)

    Article  MathSciNet  Google Scholar 

  11. Goemans, M.X., Olver, N., Rothvoß, T., Zenklusen, R.: Matroids and integrality gaps for hypergraphic Steiner tree relaxations. In: STOC, pp. 1161–1176 (2012)

    Google Scholar 

  12. Goemans, M.X., Williamson, D.P.: New \(3/4\)-approximation algorithms for the maximum satisfiability problem. SIAM J. Discrete Math. 7, 656–666 (1994)

    Article  MathSciNet  Google Scholar 

  13. Grandoni, F.: On min-power Steiner tree. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 527–538. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_46

    Chapter  Google Scholar 

  14. Hajiaghayi, M.T., Immorlica, N., Mirrokni, V.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE-ACM Trans. Netw. 15(6), 1345–1358 (2007)

    Article  Google Scholar 

  15. Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. Math. Program. 110(1), 195–208 (2007)

    Article  MathSciNet  Google Scholar 

  16. Hoffmann, S., Wanke, E.: Minimum power range assignment for symmetric connectivity in sensor networks with two power levels. Report no. 1605.01752 on arXiv, May 2016

    Google Scholar 

  17. Jia, X., Kim, D., Makki, S., Wan, P., Yi, C.: Power assignment for \(k\)-connectivity in wireless ad hoc networks. J. Comb. Optim. 9(2), 213–222 (2005)

    Article  MathSciNet  Google Scholar 

  18. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1–2), 289–305 (2000)

    Article  MathSciNet  Google Scholar 

  19. Kortsarz, G., Nutov, Z.: Approximating minimum-power edge-covers and 2, 3-connectivity. Discrete Appl. Math. 157(8), 1840–1847 (2009)

    Article  MathSciNet  Google Scholar 

  20. Krumke, S.O., Liu, R., Lloyd, E.L., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Topology control problems under symmetric and asymmetric power thresholds. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 187–198. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39611-6_17

    Chapter  Google Scholar 

  21. Lando, Y., Nutov, Z.: On minimum power connectivity problems. J. Discrete Algorithms 8(2), 164–173 (2010)

    Article  MathSciNet  Google Scholar 

  22. Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489–501 (2005)

    Article  Google Scholar 

  23. Li, M., Li, Z., Vasilakos, A.V.: A survey on topology control in wireless sensor networks: taxonomy, comparative studies and open issues. Proc. IEEE 101(12), 1.1–1.20 (2013)

    Article  Google Scholar 

  24. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. Mob. Netw. Appl. (MONET) 10, 19–34 (2005)

    Article  Google Scholar 

  25. Lloyd, E.L., Liu, R., Ravi, S.S.: Approximating the minimum number of maximum power users in ad hoc networks. Mob. Netw. Appl. (MONET) 11(2), 129–142 (2006)

    Article  Google Scholar 

  26. Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete Comput. Geom. 44(4), 883–895 (2010)

    Article  MathSciNet  Google Scholar 

  27. Nutov, Z.: Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theor. Comput. Sci. 411(26–28), 2502–2512 (2010)

    Article  MathSciNet  Google Scholar 

  28. Nutov, Z.: Activation network design problems. In: Gonzalez, T.F. (ed.) Handbook on Approximation Algorithms and Metaheuristics, chap. 15, 2nd edn, vol. 2. Chapman & Hall/CRC, London (2018)

    Google Scholar 

  29. Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)

    Article  MathSciNet  Google Scholar 

  30. Ramanathan, R., Rosales-Hain, R.: Topology control of multi-hop wireless networks using transmit power adjustment. In: INFOCOM, pp. 404–413 (2000)

    Google Scholar 

  31. Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv. 37(2), 164–194 (2005)

    Article  MathSciNet  Google Scholar 

  32. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg, New York (2004)

    MATH  Google Scholar 

Download references

Acknowledgment

Gruia and Zeev thank Neil Olver for many useful discussions. Also, Gruia and Zeev acknowledge the support of the Hausdorff Trimester Program for Combinatorial Optimization (held at the Hausdorff Research Institute for Mathematics, University of Bonn).

Author information

Authors and Affiliations

  1. Illinois Institute of Technology, Chicago, IL, USA

    Gruia Calinescu

  2. Rutgers University, Camden, USA

    Guy Kortsarz

  3. The Open University of Israel, Raanana, Israel

    Zeev Nutov

Authors
  1. Gruia Calinescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Kortsarz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zeev Nutov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zeev Nutov .

Editor information

Editors and Affiliations

  1. University of Haifa, Haifa, Israel

    Leah Epstein

  2. University of Leicester, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Calinescu, G., Kortsarz, G., Nutov, Z. (2018). Improved Approximation Algorithms for Minimum Power Covering Problems. In: Epstein, L., Erlebach, T. (eds) Approximation and Online Algorithms. WAOA 2018. Lecture Notes in Computer Science(), vol 11312. Springer, Cham. https://doi.org/10.1007/978-3-030-04693-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04693-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04692-7

  • Online ISBN: 978-3-030-04693-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation