Total Positive Influence Domination on Weighted Networks

Danica Vukadinovic Greetham, Nathaniel Charlton, Anush Poghosyan Hopes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationComplex Networks and Their Applications VIII
Subtitle of host publicationVolume 1 Proceedings of the Eighth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2019
EditorsH. Cherifi, S. Gaito, J. Mendes, E. Moro, L. Rocha
PublisherSpringer
Pages325-336
Number of pages12
ISBN (Electronic)9783030366872
ISBN (Print)9783030366865
DOIs
Publication statusPublished - 1 Jan 2020

Publication series

NameStudies in Computational Intelligence
PublisherSpringer, Cham
Volume881

Keywords

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

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Total Positive Influence Domination on Weighted Networks'. Together they form a unique fingerprint.

Cite this