The complexity of influence maximization problem in the deterministic linear threshold model
From MaRDI portal
Publication:1928515
Recommendations
- On the approximability of influence in social networks
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- Parameterized approximability of maximizing the spread of influence in networks
- Influence Maximization in Undirected Networks
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
Cites work
Cited in
(12)- On the shoulders of giants: incremental influence maximization in evolving social networks
- Algorithms for influence maximization in socio-physical networks
- Dynamic model of information diffusion based on multidimensional complex network space and social game
- Parameterized approximability of maximizing the spread of influence in networks
- The fashion game: network extension of matching pennies
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
- Optimizing spread dynamics on graphs by message passing
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
- An exact method for influence maximization based on deterministic linear threshold model
- Adaptivity gap for influence maximization with linear threshold model on trees
This page was built for publication: The complexity of influence maximization problem in the deterministic linear threshold model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928515)
