Skip to main content
SpringerLink
Log in

Blocking Rumor by Cut

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

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.

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

  • Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robus influence maximization, KDD’16. San Francisco, CA, USA

  • Chen X, Nong Q, Feng Y, Cao Y, Gong S, Fang Q, Ko K-I (2017) Centralized and decentralized rumor blocking problems. J Comb Optim 34(1):314–329

    Article  MathSciNet  MATH  Google Scholar 

  • Fan L, Wu W (2016) Rumor blocking. Encyclopedia of algorithms, pp 1887–1892

  • Fan L, LU Z, Wu W, Thuraisingham BM, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: IEEE 33rd international conference on distributed computing systems (ICDCS), pp 540–549

  • Fan L, Weili W, Zhai X, Xing K, Lee W, Ding-Zhu D (2014) Maximizing rumor containment in social networks with constrained time. Social Netw Anal Min 4(1):214

    Article  Google Scholar 

  • Fan L, Wu W, Xing K, Lee W (2016) Precautionary rumor containment via trustworthy people in social networks. Discrete Math Algorithms Appl 8(1):1650004

    Article  MathSciNet  MATH  Google Scholar 

  • Feige U, Mirrokni V, Vondrak J (2007) Maximizing nonmonotone submodular functions. In: Proceedings of the IEEE foundations of computer science, p 461C471

  • Feldman M, Naor J, Schwartz R (2011) A unified continuous greedy algorithm for submodular maximization. IEEE FOCS, pp 570–579

  • Iyer R, Bilmes J (2013) Algorithm for approximate Minimization of the difference between submodular functions, with application. arXiv:1207.0560v4

  • Lee J, Mirrokni V, Nagarajan V, Sviridenko M (2009) Nonmonotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the ACM symposium on theory of computing, p 323C332

  • Tong GA, Wu W, Guo L, Li D, Liu C, Liu B, Du D-Z (2017) An efficient randomized algorithm for rumor blocking in online social networks. INFOCOM 1–9. arXiv:1701.02368

  • Tong GA, Wu W, Du D-Z (2018) Distributed rumor blocking in social networks: a game theoretical analysis. IEEE Trans Comput Soc Syst. arXiv:1711.07412

  • Wang A, Wu W, Chen J (2014) Social network rumors spread model based on cellular automata. In: 10th international conference on mobile ad-hoc and sensor networks (MSN), pp 236–242

  • Wang Z, Yang Y, Pei J, Chen E (2016) Activity maximization by effective information diffusion in social networks. arXiv: 1610.07754v1 [cs.SI]

  • Wei L, Wei C, Lakshmanan LVS (2015) From competition to complementarity: comparative influence diffusion and maximization. Proc VLDB Endow 9(2):60–71

    Article  Google Scholar 

Download references

Funding

Funding was provided by NFSC (Grant No. 11771403).

Author information

Authors and Affiliations

  1. School of Management, Shanghai University, Shanghai, China

    Ling Gai

  2. Department of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China

    Hongwei Du

  3. Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA

    Lidong Wu

  4. College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing, 314001, China

    Junlei Zhu

  5. Department of Mathematics, Zhejiang Normal University, Jinhua, 321004, Zhejiang, China

    Yuehua Bu

  6. Zhejiang Normal University Xingzhi College, Jinhua, 321004, Zhejiang, China

    Yuehua Bu

Authors
  1. Ling Gai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lidong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Junlei Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yuehua Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Junlei Zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gai, L., Du, H., Wu, L. et al. Blocking Rumor by Cut. J Comb Optim 36, 392–399 (2018). https://doi.org/10.1007/s10878-018-0304-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0304-8

Keywords

Search

Navigation