Influence maximization: near-optimal time complexity meets practical efficiency
SIGMOD Conference, pp. 75-86, 2014.
Given a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model. This problem finds important applications in viral marketing, and has been extensively studied in the literature. Existing algorithm...More
PPT (Upload PPT)