Influence Maximization (IM) is a fundamental problem in social network analysis that aims to identify a set of k seed nodes that maximizes influence spread under a given propagation model. Despite its importance in applications such as viral marketing and epidemic control, the IM problem is NP-hard, making exact solutions computationally infeasible for large-scale networks. Existing approximation methods typically rely either on static centrality heuristics, which often ignore global network structure, or on metaheuristic algorithms, which may suffer from slow convergence due to random initialization. This paper proposes a novel approach, termed Advanced Centrality-Driven Discrete Particle Swarm Optimization (DPSO), which integrates a weighted hybrid centrality score combining Degree, PageRank, and Betweenness centrality to guide the stochastic search process. In addition, a systematic grid search methodology is employed to determine the optimal weight configuration of the hybrid score. Experiments conducted on three real-world datasets (Twitter, ego-Facebook, and ca-HepTh) demonstrate that the optimal seeding strategy is strongly dependent on network topology. The results show that dense social networks favor popularity-based metrics such as Degree and PageRank, whereas sparse collaboration networks benefit significantly from bridge-oriented metrics such as Betweenness centrality. Overall, the proposed method achieves consistent improvements in influence spread across different network types, with the largest gains (up to 70%) observed in sparse network settings.
Papadakis et al. (Sun,) studied this question.