Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
From MaRDI portal
Publication:2946695
DOI10.1145/2480759.2480762zbMath1354.91122DBLPjournals/tocl/ShakarianBSM13OpenAlexW2028757431WikidataQ62047416 ScholiaQ62047416MaRDI QIDQ2946695
Cristian Molinaro, Paulo Shakarian, V. S. Subrahmanian, Matthias Broecheler
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2480759.2480762
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)
Related Items (2)
Diffusion centrality: a paradigm to maximize spread in social networks ⋮ ChoiceGAPs: Competitive Diffusion as a Massive Multi-player Game in Social Networks
This page was built for publication: Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems