Multi-Round Influence Maximization: A Variable Neighborhood Search Approach

Abstract

This work addresses the Multi-Round Influence Maximization problem, where a set of seed nodes must be selected over several rounds to maximize cumulative influence spread, proposing a Variable Neighborhood Search metaheuristic.

Publication
Lecture Notes in Computer Science