An efficient network-aware direct search method for influence maximization

DOI10.1093/COMNET/CNAF042MaRDI QIDQ7321466zbMATH OpenFDO

Authors Matteo Bergamaschi, Sara Venturini, Francesco Tudisco, F. Rinaldi

Publication date 28 August 2026

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/COMNET/CNAF042

Mathematics Subject Classification ID

Special processes (60Kxx) Operations research, mathematical programming (90-XX) Mathematical programming (90Cxx)

Cites work

• A contribution to the mathematical theory of epidemics.
• A model for spatial conflict
• A new status index derived from sociometric analysis
• Derivative-free and blackbox optimization
• Derivative-free optimization methods
• Introduction to Derivative-Free Optimization
• Machine Learning: ECML 2004
• Maximizing social influence in nearly optimal time
• Submodularity of influence in social networks: from local to global

This page was built for publication: An efficient network-aware direct search method for influence maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7321466)