Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Browsing Endüstri Mühendisliği Bölümü Koleksiyonu by Journal "Information Sciences"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation - WoS: 25
    Citation - Scopus: 25
    An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks
    (Elsevier, 2019) Güney, Evren; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
    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 that approximates the original problem by Monte Carlo sampling. Next, to solve IMP efficiently, we propose a linear programming relaxation based method with a provable worst case bound 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 terms of solution quality and this is one of the few studies that provides approximate optimal solutions for certain real life social networks.
  • Thumbnail Image
    Correction
    An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks (vol 503, Pg 589, 2019)
    (Elsevier, 2020) Güney, Evren; 02.01. Department of Industrial Engineering; 02. Faculty of Engineering; 01. MEF University
    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.