Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems

DOI10.1145/2480759.2480762MaRDI QIDQ2946695zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro

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

zbMATH Keywords

social networkapproximation algorithmsgeneralized annotated programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Approximation algorithms (68W25)

Recommendations

• Using generalized annotated programs to solve social network optimization problems
• A nonlinear programming approach to the study of social networks
• Exploiting answer set programming for handling information diffusion in a multi-social-network scenario
• Structural search and optimization in social networks
• A two-stage stochastic programming approach for influence maximization in social networks
• Social influence-based optimization problems

Cited in

(4)

• Using generalized annotated programs to solve social network optimization problems
• Diffusion centrality: a paradigm to maximize spread in social networks
• Computational aspects of optimal strategic network diffusion
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946695)