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

Grant Schoenebeck Biaoshuai Tao

Published in: WINE (2017)

Keyphrases

influence maximization
greedy algorithm
worst case
approximation algorithms
information propagation
social networks
np hard
upper bound
error bounds
viral marketing
diffusion model
computational complexity
optimal solution
lower bound
multiscale
online social networks