An embedding-guided variable-length evolutionary algorithm for three-objective influence maximization is reported to beat NSGA-II variants, though its claimed NP-hardness proof and experimental details are missing.
Maximizing the spread of influence through a so- cial network
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Influence Maximization Considering Influence, Cost and Time
An embedding-guided variable-length evolutionary algorithm for three-objective influence maximization is reported to beat NSGA-II variants, though its claimed NP-hardness proof and experimental details are missing.