Efficient Approximation Algorithms for Adaptive Influence Maximization

Keke Huang, Jing Tang, Kai Han +5

Given a social network $G$ and an integer $k$, the influence maximization (IM) problem asks for a seed set $S$ of $k$ nodes from $G$ to maximize the expected number of nodes influe…