László Hajdu
Miklós Krész
2021-09-24
<p>A new problem called influence monitoring is defined and studied for the Generalized Independent Cascade Problem. It is shown that the objective function of the problem is submodular by which the greedy algorithm can ensure an approximate ratio. The efficient implementation of the greedy method is described from algorithm design point of view.</p>
551-556.
https://doi.org/10.5281/zenodo.5532305
oai:zenodo.org:5532305
isbn:978-961-6165-57-0
Zenodo
https://zenodo.org/communities/innorenew
https://zenodo.org/communities/eu
https://doi.org/10.5281/zenodo.5532304
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
SOR'21, The 16th International Symposium on Operational Research in Slovenia, Slovenia (online), 22-24 September 2021
infection processes
influence maximization
greedy algorithm
network optimisation
network immunization
THE INFLUENCE MONITORING PROBLEM
info:eu-repo/semantics/conferencePaper