Now showing items 1-2 of 2
A branch‐and‐cut approach for the least cost influence problem on social networks
This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ...
Least-cost influence maximization on social networks
Viral-marketing strategies are of significant interest in the online economy. Roughly, in these problems, one seeks to identify which individuals to strategically target in a social network so that a given proportion of ...
Share this page