## Abstract

We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominating set problem in weighted networks. Applications of this problem in weighted settings include finding: a minimum cost set of nodes to broadcast a message in social networks, such that each node has majority of neighbours broadcasting that message; a maximum trusted set in bitcoin network; an optimal set of hosts when running distributed apps etc. Extensive experiments on different generated and real networks highlight

advantages and potential issues for each algorithm.

advantages and potential issues for each algorithm.

Original language | English |
---|---|

Title of host publication | Complex Networks and Their Applications VIII |

Subtitle of host publication | Volume 1 Proceedings of the Eighth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2019 |

Editors | H. Cherifi, S. Gaito, J. Mendes, E. Moro, L. Rocha |

Publisher | Springer |

Pages | 325-336 |

Number of pages | 12 |

ISBN (Electronic) | 9783030366872 |

ISBN (Print) | 9783030366865 |

DOIs | |

Publication status | Published - 1 Jan 2020 |

### Publication series

Name | Studies in Computational Intelligence |
---|---|

Publisher | Springer, Cham |

Volume | 881 |

## Keywords

- Domination sets
- Network communities
- Total positive influence
- Vertex-weighted networks

## ASJC Scopus subject areas

- Artificial Intelligence