A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks.
Jiehui PanTian-Ming BuPublished in: INFOCOM Workshops (2019)
Keyphrases
- greedy algorithm
- influence maximization
- social networks
- worst case
- greedy algorithms
- greedy strategy
- objective function
- social network analysis
- set cover
- viral marketing
- influential nodes
- greedy heuristic
- influence spread
- minimum cost
- knapsack problem
- social media
- online social networks
- complex networks
- randomized algorithm
- upper bound
- submodular functions
- dynamic programming
- lower bound
- computational complexity