An efficient linear programming based method for the influence maximization problem in social networks (vol 503, pg 589, 2019)
MetadataShow full item record
CitationGüney, E. (February 2020). An efficient linear programming based method for the influence maximization problem in social networks (vol 503, pg 589, 2019). Information Sciences, 511, 309-309.
The influence maximization problem (IMP) aims to determine the most influential individuals within a social network. In this study first we develop a binary integer program thatapproximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently,we propose a linear programming relaxation based method with a provable worst casebound that converges to the current state-of-the-art 1 − 1/e bound asymptotically. Experimental analysis indicate that the new method is superior to the state-of-the-art in termsof solution quality and this is one of the few studies that provides approximate optimalsolutions for certain real life social networks.