IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i2d10.1007_s10878-018-0304-8.html
   My bibliography  Save this article

Blocking Rumor by Cut

Author

Listed:
  • 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
    Zhejiang Normal University Xingzhi College)

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.

Suggested Citation

  • Ling Gai & Hongwei Du & Lidong Wu & Junlei Zhu & Yuehua Bu, 2018. "Blocking Rumor by Cut," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 392-399, August.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0304-8
    DOI: 10.1007/s10878-018-0304-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0304-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-0304-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xin Chen & Qingqin Nong & Yan Feng & Yongchang Cao & Suning Gong & Qizhi Fang & Ker-I Ko, 2017. "Centralized and decentralized rumor blocking problems," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 314-329, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang, 2019. "Maximizing profit of multiple adoptions in social networks with a martingale approach," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 1-20, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0304-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.