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

Grant Schoenebeck Biaoshuai Tao

Published in: CoRR (2017)

Keyphrases

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