On minimum submodular cover with submodular cost

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

doi:10.1007/s10898-010-9563-3

On minimum submodular cover with submodular cost

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

School of Cybersecurity

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	229-234
Number of pages	6
Journal	Journal of Global Optimization
Volume	50
Issue number	2
DOIs	https://doi.org/10.1007/s10898-010-9563-3
Publication status	Published - 2011 Jun

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

Access to Document

10.1007/s10898-010-9563-3

Cite this

@article{8b6bf0c3f2e84ea1b7e266863c67af60,

title = "On minimum submodular cover with submodular cost",

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.",

keywords = "MOC-CDS, Minimum submodular cover, Submodular cost",

author = "Hongjie Du and Weili Wu and Wonjun Lee and Qinghai Liu and Zhao Zhang and Du, {Ding Zhu}",

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.",

year = "2011",

month = jun,

doi = "10.1007/s10898-010-9563-3",

language = "English",

volume = "50",

pages = "229--234",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - On minimum submodular cover with submodular cost

AU - Du, Hongjie

AU - Wu, Weili

AU - Lee, Wonjun

AU - Liu, Qinghai

AU - Zhang, Zhao

AU - Du, Ding Zhu

N1 - 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.

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - MOC-CDS

KW - Minimum submodular cover

KW - Submodular cost

UR - http://www.scopus.com/inward/record.url?scp=79956207895&partnerID=8YFLogxK

U2 - 10.1007/s10898-010-9563-3

DO - 10.1007/s10898-010-9563-3

M3 - Article

AN - SCOPUS:79956207895

SN - 0925-5001

VL - 50

SP - 229

EP - 234

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 2

ER -

On minimum submodular cover with submodular cost

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this