Blocking Rumor by Cut |
| |
| Authors: | Ling Gai Hongwei Du Lidong Wu Junlei Zhu Yuehua Bu |
| |
| Institution: | 1.School of Management,Shanghai University,Shanghai,China;2.Department of Computer Science and Technology,Harbin Institute of Technology Shenzhen Graduate School,Shenzhen,China;3.Department of Computer Science,University of Texas at Tyler,Tyler,USA;4.College of Mathematics, Physics and Information Engineering,Jiaxing University,Jiaxing,China;5.Department of Mathematics,Zhejiang Normal University,Jinhua,China;6.Zhejiang Normal University Xingzhi College,Jinhua,China |
| |
| 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: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
