A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks |
scientific article; zbMATH DE number 7576468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks |
scientific article; zbMATH DE number 7576468 |
Statements
A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (English)
0 references
26 August 2022
0 references
social network
0 references
positive influence dominating set
0 references
submodular function
0 references
greedy approximation
0 references
0 references
0.8467239141464233
0 references
0.8332664966583252
0 references
0.8113091588020325
0 references
0.79863440990448
0 references
