17 citations · 29 across the 6 of their papers we have counts for
1 paper · 2 filters
George Panagopoulos, Nikolaos Tziortziotis, Michalis Vazirgiannis +1
Finding the seed set that maximizes the influence spread over a network is a well-known NP-hard problem. Though a greedy algorithm can provide near-optimal solutions, the subproble…