Revisiting the stop-and-stare algorithms for influence maximization

• المؤلفون الرئيسيون: Huang, Keke, Wang, Sibo, Bevilacqua, Glenn, Xiao, Xiaokui, Lakshmanan, Laks V. S.
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2019
• الموضوعات: Social Network; Engineering::Computer science and engineering; SSA-Fix
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/105713; http://hdl.handle.net/10220/49548; http://dx.doi.org/10.14778/3099622.3099623

Influence maximization is a combinatorial optimization problem that finds important applications in viral marketing, feed recommendation, etc. Recent research has led to a number of scalable approximation algorithms for influence maximization, such as TIM+ and IMM, and more recently, SSA and D-SSA....