Güney, Evren2020-01-062020-01-062020Gü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.0020-02551872-6291https://hdl.handle.net/20.500.11779/1275https://doi.org/10.1016/j.ins.2019.10.034Document Type:CorrectionThe 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.eninfo:eu-repo/semantics/closedAccessInfluence maximizationStochastic optimizationPipage methodSample average approximationCorrection10.1016/j.ins.2019.10.0342-s2.0-85073616026