IM in topologically known networks. Kempe et al. [1]} originally introduced the problem formulation of IM when the network structure is initially known and proposed a greedy approach to solve it. Besides heuristic solutions that are scalable to large-scale networks [2]}, [3]}, many following-up studies in this field focused mostly on reducing the computational complexity of greedy algorithms, such as CELF [4]}, TIM/TIM+ [5]}, IMM [6]}, and SSA/D-SSA [7]}, while providing approximate solutions with performance guarantees. Apart from the complexity reduction, other approaches include but are not limtied to new optimization methods [8]}, [9]} and IM in multiplex networks [10]}. For a more thorough summary, see [11]}, for an in-depth performance comparison and discussion of approaches in the literature, see [12]}.
