Conference paper Open Access
THE INFLUENCE MONITORING PROBLEM
László Hajdu; Miklós Krész
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.
551-556.
Files
(5.3 MB)
| Name | Size | |
|---|---|---|
|
Monitoring.pdf
md5:887d9a86a3e4f9b61a715185050bb1e6 |
5.3 MB | Download |
20
21
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 20 | 20 |
| Downloads | 21 | 21 |
| Data volume | 111.9 MB | 111.9 MB |
| Unique views | 17 | 17 |
| Unique downloads | 18 | 18 |
Indexed in
- Publication date:
- September 24, 2021
- DOI:
-
- Keyword(s):
- infection processes influence maximization greedy algorithm network optimisation network immunization
- Grants:
-
European Commission:
- InnoRenew CoE - Renewable materials and healthy environments research and innovation centre of excellence (739574)
- Meeting:
- The 16th International Symposium on Operational Research in Slovenia (SOR'21), Slovenia (online), 22-24 September 2021
- Alternate identifiers:
-
- 978-961-6165-57-0 (ISBN)
- Communities:
- License (for files):
- Creative Commons Attribution 4.0 International