Least-cost influence maximization on social networks

DOI10.1287/IJOC.2019.0886MaRDI QIDQ3386763zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 7 January 2021

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2019.0886

zbMATH Keywords

social networkscomplexitygreedy algorithminteger programminginfluence maximizationstrong formulation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Integer programming (90C10)

Recommendations

• Least cost influence propagation in (social) networks
• A polyhedral approach to least cost influence maximization in social networks
• scientific article; zbMATH DE number 6474901
• Optimizing spread of influence in social networks via partial incentives
• Fast and frugal targeting with incentives

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A two-stage stochastic programming approach for influence maximization in social networks
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• Identifying Influential and Susceptible Members of Social Networks
• Introduction to algorithms.
• Least cost influence propagation in (social) networks
• On the approximability of influence in social networks
• Optimizing spread of influence in social networks via partial incentives
• The 0-1 knapsack problem with a single continuous variable

Cited in

(19)

• Using generalized annotated programs to solve social network optimization problems
• Optimal intervention in economic networks using influence maximization methods
• Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
• Efficient presolving methods for the influence maximization problem
• Cost effective campaigning in social networks
• Minimizing the expected complete influence time of a social network
• Discount allocation for cost minimization in online social networks
• A branch‐and‐cut approach for the least cost influence problem on social networks
• An efficient local search algorithm for minimum positive influence dominating set problem
• Least cost influence propagation in (social) networks
• Optimizing spread of influence in social networks via partial incentives
• Incentive rate determination in viral marketing
• Influence maximization with latency requirements on social networks
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• A polyhedral approach to least cost influence maximization in social networks
• Cost-Effective Social Media Influencer Marketing
• Profit maximization problem with coupons in social networks
• A polyhedral study of dynamic monopolies
• Weighted target set selection on trees and cycles

This page was built for publication: Least-cost influence maximization on social networks

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