Fetching the paper…
Reading the bibliography…
Influence Maximization (IM), that seeks a small set of key users who spread the influence widely into the network, is a core problem in multiple domains.
M. Minoux, “Accelerated greedy algorithms for maximizing submodular set functions,” in Optimization Techniques
1978
Earlier work this paper cites.
G. L. Nemhauser and L. A. Wolsey, “Maximizing submodular set functions: formulations and analysis of algorithms,” North-Holland Mathematics Studies
1981
Earlier work this paper cites.
S. Khuller, A. Moss, and J. S. Naor, “The budgeted maximum coverage problem,” Information Processing Letters
1999
Earlier work this paper cites.
P. Dagum, R. Karp, M. Luby, and S. Ross, “An optimal algorithm for monte carlo estimation,” SIAM J. Comput
2000
Earlier work this paper cites.
D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in KDD’03
2003
Earlier work this paper cites.
J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in ACM KDD ’07
2007
Earlier work this paper cites.
W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in KDD ’09
2009
Earlier work this paper cites.
N. Chen, “On the approximability of influence in social networks,” SIAM Journal of Discrete Mathematics
2009
Earlier work this paper cites.
W. Chen, C. Wang, and Y. Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in ACM KDD ’10
2010
Earlier work this paper cites.
Y. Wang, G. Cong, G. Song, and K. Xie, “Community-based greedy algorithm for mining top-k influential nodes in mobile social networks,” in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
2010
Earlier work this paper cites.
A. Goyal, F. Bonchi, and L. V. Lakshmanan, “Learning influence probabilities in social networks,” in Proc. ACM WSDM
2010
Earlier work this paper cites.
H. Kwak, C. Lee, H. Park, and S. Moon, “What is twitter, a social network or a news media?,” in Proceedings of the 19th international conference on World wide web
2010
Cited alongside, same era.
A. Goyal, W. Lu, and L. Lakshmanan, “Simpath: An efficient algorithm for influence maximization under the linear threshold model,” in Data Mining (ICDM), 2011 IEEE 11th International Conference on
2011
Cited alongside, same era.
A. Goyal, W. Lu, and L. Lakshmanan, “Celf++: optimizing the greedy algorithm for influence maximization in social networks,” in Proceedings of the 20th international conference companion on World wide web
2011
Cited alongside, same era.
A. Goyal, W. Lu, and L. V. Lakshmanan, “Celf++: optimizing the greedy algorithm for influence maximization in social networks,” in Proceedings of the 20th international conference companion on World wide web
2011
Cited alongside, same era.
N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha, “Scalable influence estimation in continuous-time diffusion networks,” in Advances in neural information processing systems
2013
Later among the works it cites.
H. Nguyen and R. Zheng, “On budgeted influence maximization in social networks,” Selected Areas in Communications, IEEE Journal on
2013
Later among the works it cites.
E. Cohen, D. Delling, T. Pajor, and R. F. Werneck, “Sketch-based influence maximization and computation: Scaling up with guarantees,” in Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
2014
Later among the works it cites.
N. Ohsaka, T. Akiba, Y. Yoshida, and K.-i. Kawarabayashi, “Fast and accurate influence maximization on large networks with pruned monte-carlo simulations,” in Twenty-Eighth AAAI Conference on Artificial Intelligence
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Shen, T. N. Dinh, H. Zhang, and M. T. Thai, “Interest-matching information propagation in multiple online social networks,” in Proceedings of the 21st ACM International Conference on Information and Knowledge Management
2012
Cited alongside, same era.
K. Jung, W. Heo, and W. Chen, “Irie: Scalable and robust influence maximization in social networks,” in Data Mining (ICDM), 2012 IEEE 12th International Conference on
2012
Cited alongside, same era.
W. Chen, W. Lu, and N. Zhang, “Time-critical influence maximization in social networks with time-delayed diffusion process,” in Twenty-Sixth AAAI Conference on Artificial Intelligence
2012
Cited alongside, same era.
D. T. Nguyen, H. Zhang, S. Das, M. T. Thai, and T. N. Dinh, “Least cost influence in multiplex social networks: Model representation and analysis,” in Data Mining (ICDM), 2013 IEEE 13th International Conference on
2013
Cited alongside, same era.
H. T. Nguyen, M. T. Thai, and T. N. Dinh, “Cost-aware targeted viral marketing in billion-scale networks,” in INFOCOM, 2016 Proceedings IEEE
2013
Cited alongside, same era.
K. Kutzkov, A. Bifet, F. Bonchi, and A. Gionis, “Strip: stream learning of influence probabilities,” in Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
2013
Cited alongside, same era.
H. Zhang, T. Dinh, and M. Thai, “Maximizing the spread of positive influence in online social networks,” in Distributed Computing Systems (ICDCS), 2013 IEEE 33rd International Conference on
2013
Cited alongside, same era.
Y. Tang, X. Xiao, and Y. Shi, “Influence maximization: Near-optimal time complexity meets practical efficiency,” in Proceedings of SIGMOD international conference on Management of data
2014
Later among the works it cites.
T. N. Dinh, Y. Shen, D. T. Nguyen, and M. T. Thai, “On the approximability of positive influence dominating set in social networks,” Journal of Combinatorial Optimization
2014
Later among the works it cites.
C. Borgs, M. Brautbar, J. Chayes, and B. Lucier, “Maximizing social influence in nearly optimal time,” in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2014
Later among the works it cites.
T. Dinh, H. Zhang, D. Nguyen, and M. Thai, “Cost-effective viral marketing for time-critical campaigns in large-scale social networks,” Networking, IEEE/ACM Transactions on
2014
Later among the works it cites.
Y. Tang, Y. Shi, and X. Xiao, “Influence maximization in near-linear time: A martingale approach,” in Proceedings of SIGMOD International Conference on Management of Data
2015
Later among the works it cites.
Y. Li, D. Zhang, and K.-L. Tan, “Real-time targeted influence maximization for online advertisements,” Proceedings of the VLDB Endowment
2015
Later among the works it cites.