Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization.

Grant Schoenebeck Biaoshuai Tao

Published in: ACM Trans. Comput. Theory (2019)

Keyphrases

influence maximization
greedy algorithm
worst case
approximation algorithms
information propagation
upper bound
social networks
lower bound
np hard
diffusion model
viral marketing
error bounds
computational complexity
objective function
dynamic programming
seed set
social network analysis