On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization.
Chuan ZhouPeng ZhangWenyu ZangLi GuoPublished in: IEEE Trans. Knowl. Data Eng. (2015)
Keyphrases
- influence maximization
- greedy algorithm
- greedy algorithms
- upper bound
- information propagation
- worst case
- lower bound
- influential nodes
- upper and lower bounds
- influence propagation
- objective function
- diffusion models
- social networks
- dynamic programming
- lower and upper bounds
- seed set
- knapsack problem
- viral marketing
- special case
- website