EconPapers    
Economics at your fingertips  
 

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

Ailian Wang (), Weili Wu () and Lei Cui ()
Additional contact information
Ailian Wang: Taiyuan University of Technology
Weili Wu: Taiyuan University of Technology
Lei Cui: University of Texas at Dallas

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 21, 1678-1684

Abstract: 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.

Keywords: Bharathi–Kempe–Salek conjecture; Influence maximization; In-arborescence; Independent cascade (IC) model; Linear threshold Model (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-9991-1 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:31:y:2016:i:4:d:10.1007_s10878-016-9991-1

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

DOI: 10.1007/s10878-016-9991-1

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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-016-9991-1