Total positive influence domination on weighted networks
Optimization and Control
2019-10-11 v2 Discrete Mathematics
Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1604.07661,
title = {Total positive influence domination on weighted networks},
author = {Danica Vukadinović Greetham and Nathaniel Charlton and Anush Poghosyan},
journal= {arXiv preprint arXiv:1604.07661},
year = {2019}
}