A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds -a central problem in the study of network cascades. The majority of existing work on this problem, formally referred to as the influence maximization problem, is designed for submodular cascades. Despite the empirical evidence that many cascades are non-submodular, little work has been done focusing on non-submodular influence maximization. We propose a new heuristicdoi:10.1007/978-3-319-71924-5_2 fatcat:6k3lduauq5h4rfl5nchgm45eyq