Blocking Rumor by Cut

Ling Gai (), Hongwei Du (), Lidong Wu (), Junlei Zhu () and Yuehua Bu ()
Additional contact information
Ling Gai: Shanghai University
Hongwei Du: Harbin Institute of Technology Shenzhen Graduate School
Lidong Wu: University of Texas at Tyler
Junlei Zhu: Jiaxing University
Yuehua Bu: Zhejiang Normal University

Journal of Combinatorial Optimization, 2018, vol. 36, issue 2, No 4, 392-399

Abstract: Abstract In this paper, a rumor blocking problem is studied with an objective function which is neither submodular or supermodular. We will prove that this problem is NP-hard and give a data-dependent approximation with sandwich method. In addition, we show that every set function has a pair of monotone nondecreasing modular functions as upper bound and lower bound, respectively.

Keywords: NP-hard; Sandwich method; Monotone (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0304-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0304-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0304-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().