Least-cost influence maximization on social networks
From MaRDI portal
Publication:3386763
DOI10.1287/IJOC.2019.0886zbMATH Open1461.91224OpenAlexW2990327145WikidataQ126662456 ScholiaQ126662456MaRDI QIDQ3386763FDOQ3386763
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
Recommendations
social networkscomplexitygreedy algorithminteger programminginfluence maximizationstrong formulation
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- The 0-1 knapsack problem with a single continuous variable
- On the approximability of influence in social networks
- Identifying Influential and Susceptible Members of Social Networks
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Least cost influence propagation in (social) networks
- Optimizing spread of influence in social networks via partial incentives
- A two-stage stochastic programming approach for influence maximization in social networks
Cited In (19)
- Using generalized annotated programs to solve social network optimization problems
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
- Optimal intervention in economic networks using influence maximization methods
- Efficient presolving methods for the influence maximization problem
- Cost effective campaigning in social networks
- Minimizing the expected complete influence time of a social network
- 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
- Discount allocation for cost minimization in online social networks
- 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)
