On minimum submodular cover with submodular cost

Hongjie Du, Weili Wu, Wonjun Lee, Qinghai Liu, Zhao Zhang, Ding Zhu Du

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)229-234
Number of pages6
JournalJournal of Global Optimization
Volume50
Issue number2
DOIs
Publication statusPublished - 2011 Jun

Bibliographical note

Funding Information:
Acknowledgments This work was supported in part by National Science Foundation of USA under grants CCF-0728851 and CCF-9208913. This research was also jointly supported by MEST, Korea, under WCU (R33-2008-000-10044-0), a KOSEF Grant funded by the Korean Government (MEST) (No. R01-2007-000-11203-0), a KRF Grant (KRF-2008-314-D00354), and MKE, Korea under ITRC NIPA-2010-(C1090-1021-0008). Corresponding author: Wonjun Lee.

Keywords

  • MOC-CDS
  • Minimum submodular cover
  • Submodular cost

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On minimum submodular cover with submodular cost'. Together they form a unique fingerprint.

Cite this