Copy the page URI to the clipboard
Vukadinovic Greetham, Danica; Nathaniel, Charlton and Anush, Poghosyan
(2019).
DOI: https://doi.org/10.1007/978-3-030-36687-2_27
Abstract
We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominat- ing set problem in weighted networks. Applications of this problem in weighted settings include finding: a minimum cost set of nodes to broad- cast 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. Ex- tensive experiments on different generated and real networks highlight advantages and potential issues for each algorithm.
Viewing alternatives
Download history
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 67223
- Item Type
- Conference or Workshop Item
- ISBN
- 3-030-36687-1, 978-3-030-36687-2
- Keywords
- domination sets, total positive influence, vertex-weighted networks, network communities
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2019 Danica Vukadinovic Greetham, © 2019 Springer
- Depositing User
- Danica Vukadinovic Greetham