IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i4d10.1007_s10878-016-9991-1.html
   My bibliography  Save this article

On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence

Author

Listed:
  • Ailian Wang

    (Taiyuan University of Technology)

  • Weili Wu

    (Taiyuan University of Technology
    University of Texas at Dallas)

  • Lei Cui

    (University of Texas at Dallas)

Abstract

Bharathi et al. (WINE, pp 306–311, 2007) conjectured that the influence maximization problem is NP-hard for arborescence directed into a root. In this note, we show that this conjecture is not true for deterministic diffusion model and linear threshold (LT) model, that is, there exist polynomial-time algorithms for the influence maximization problem in those two models on arborescence directed into a root. This means that if the conjecture in the independent cascade (IC) model is true, then it would give an interesting difference between the IC model and the LT model.

Suggested Citation

  • Ailian Wang & Weili Wu & Lei Cui, 2016. "On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1678-1684, May.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-016-9991-1
    DOI: 10.1007/s10878-016-9991-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-9991-1
    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-016-9991-1?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. Lidan Fan & Zaixin Lu & Weili Wu & Yuanjun Bi & Ailian Wang & Bhavani Thuraisingham, 2014. "An individual-based model of information diffusion combining friends’ influence," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 529-539, October.
    2. Yuqing Zhu & Weili Wu & Yuanjun Bi & Lidong Wu & Yiwei Jiang & Wen Xu, 2015. "Better approximation algorithms for influence maximization in online social networks," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 97-108, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chuangen Gao & Shuyang Gu & Jiguo Yu & Hai Du & Weili Wu, 2022. "Adaptive seeding for profit maximization in social networks," Journal of Global Optimization, Springer, vol. 82(2), pages 413-432, February.
    2. Hemant Gehlot & Shreyas Sundaram & Satish V. Ukkusuri, 2023. "Algorithms for influence maximization in socio-physical networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-28, January.
    3. Zaixin Lu & Zhao Zhang & Weili Wu, 2017. "Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 803-808, February.

    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. C Prem Sankar & Asharaf S. & K Satheesh Kumar, 2016. "Learning from Bees: An Approach for Influence Maximization on Viral Campaigns," PLOS ONE, Public Library of Science, vol. 11(12), pages 1-15, December.
    2. Zaixin Lu & Zhao Zhang & Weili Wu, 2017. "Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 803-808, February.
    3. Abbas Salehi & Behrooz Masoumi, 2020. "KATZ centrality with biogeography-based optimization for influence maximization problem," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 205-226, 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:31:y:2016:i:4:d:10.1007_s10878-016-9991-1. 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.