Skip to main content
SpringerLink
Log in

On minimum submodular cover with submodular cost

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we show that a minimum non-submodular cover problem can be reduced into a problem of minimum submodular cover with submodular cost. In addition, we present an application in wireless sensor networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Wolsey L.A.: An analysis of the greedy algorithm for submodular set covering problem. Combinatorica 2(4), 385–393 (1982)

    Article  Google Scholar 

  2. Du, D.-Z., Graham, R.L., Pardalos, P.M., Wan, P.-J., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of the 19th annual ACM-SIAM symposium on dicrete algorithms (SODA), pp. 167–175 (2008)

  3. Wan P.-J., Du D.-Z., Pardalos P.M., Wu W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2), 463–474 (2010)

    Article  Google Scholar 

  4. Cardei M., Cheng M.X., Cheng X., Du D.-Z.: Connected domination in ad hoc wireless networks. In: Proceedings of the 6th international conference on computer science and informatics (2002)

  5. Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE Symposium on Computer and Communications (1998)

  6. Wan, P.-J., Alzoubi, K. M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of 3rd ACM international workshop on discrete algorithms and methods for mobile computing and communications, pp. 7–14 (1999)

  7. Ding, L., Gao, X., Wu, W., Lee, W., Zhu, X., Du, D.-Z.: Distributed construction of connected dominating sets with minimum routing cost in wireless network. In: The 30th international conference on distributed computing systems (2010)

  8. Willson J., Gao X., Qu Z., Zhu Y., Li Y., Wu W.: Efficient distributed algorithms for topology control problem with shortest path constraints, discrete mathematics. Algorithms Appl. 1(4), 437–461 (2009)

    Article  Google Scholar 

  9. Wan, P.-J., Wang, L., Yao, F.: Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: ICDCS, pp. 337–344 (2008)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA

    Hongjie Du, Weili Wu & Ding-Zhu Du

  2. Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea

    Wonjun Lee

  3. College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, People’s Republic of China

    Qinghai Liu & Zhao Zhang

Authors
  1. Hongjie Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wonjun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qinghai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wonjun Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Du, H., Wu, W., Lee, W. et al. On minimum submodular cover with submodular cost. J Glob Optim 50, 229–234 (2011). https://doi.org/10.1007/s10898-010-9563-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-010-9563-3

Keywords

Search

Navigation