Fetching the paper…
Reading the bibliography…
Given a weighted hypergraph $\mathcal{H}(V, \mathcal{E} \subseteq 2^V, w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted coverage by \emph{sampling only a few hyperedges} in $\mathcal{E}$.
Reducibility among combinatorial problems
R. M. Karp. 1972 · 1972
Earlier work this paper cites.
Maximizing submodular set functions: formulations and analysis of algorithms
G. L. Nemhauser and L. A. Wolsey. 1981 · 1981
Earlier work this paper cites.
Linear programming in linear time when the dimension is fixed
N. Megiddo. 1984 · 1984
Earlier work this paper cites.
The Simplex Algorithm: A Probabilistic Analysis, Algorithms and Combinatorics
K. Borgwardt. 1987 · 1987
Earlier work this paper cites.
A threshold of ln n for approximating set cover
U. Feige. 1998 · 1998
Earlier work this paper cites.
An Optimal Algorithm for Monte Carlo Estimation
P. Dagum, R. Karp, M. Luby, and S. Ross. 2000 · 2000
Earlier work this paper cites.
Mining the network value of customers. In KDD . ACM, 57–66
P. Domingos and M. Richardson. 2001 · 2001
Earlier work this paper cites.
Maximizing the spread of influence through a social network. In KDD . 137–146
D. Kempe, J. Kleinberg, and É. Tardos. 2003 · 2003
Earlier work this paper cites.
Cost-effective outbreak detection in networks. In KDD . 420–429
J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. 2007 · 2007
Earlier work this paper cites.
Fast shortest path distance estimation in large networks. In CIKM . 867–876
M Potamias, F. Bonchi, C. Castillo, and A. Gionis. 2009 · 2009
Earlier work this paper cites.
Scalable influence maximization in social networks under the linear threshold model. In ICDM . 88–97
W. Chen, Y. Yuan, and L. Zhang. 2010 · 2010
Earlier work this paper cites.
What is Twitter, a social network or a news media?. In WWW . 591–600
H. Kwak, C. Lee, H. Park, and S. Moon. 2010 · 2010
Cited alongside, same era.
Hoeffding’s inequality for supermartingales
X. Fan, I. Grama, and Q. Liu. 2012 · 2012
Cited alongside, same era.
Irie: Scalable and robust influence maximization in social networks. In ICDM . 918–923
K. Jung, W. Heo, and W. Chen. 2012 · 2012
Cited alongside, same era.
Scalable influence estimation in continuous-time diffusion networks. In NIPS . 3147–3155
N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha. 2013 · 2013
Cited alongside, same era.
Cost-aware Targeted Viral Marketing in Billion-scale Networks. In INFOCOM . 55–59
H. T. Nguyen, M. T. Thai, and T. N. Dinh. 2013 · 2013
Cited alongside, same era.
Maximizing Social Influence in Nearly Optimal Time. In SODA . SIAM, 946–957
C. Borgs, M. Brautbar, J. Chayes, and B. Lucier. 2014 · 2014
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
H. T. Nguyen, M. T. Thai, and T. N. Dinh. 2016b · 2016
Later among the works it cites.
Dynamic influence analysis in evolving networks
N. Ohsaka, T. Akiba, Y. Yoshida, and K. Kawarabayashi. 2016 · 2016
Later among the works it cites.
Stanford network analysis project
07.01.2017 · 2017
Later among the works it cites.
Debunking the myths of influence maximization: An in-depth benchmarking study. In SIGMOD . 651–666
A. Arora, S. Galhotra, and S. Ranu. 2017 · 2017
Later among the works it cites.
Revisiting the stop-and-stare algorithms for influence maximization
K. Huang, S. Wang, G. Bevilacqua, X. Xiao, and L. V. S. Lakshmanan. 2017 · 2017
Later among the works it cites.
Better Streaming Algorithms for the Maximum Coverage Problem. In ICDT . 1–18
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sketch-based influence maximization and computation: Scaling up with guarantees. In CIKM . 629–638
E. Cohen, D. Delling, T. Pajor, and R. F. Werneck. 2014 · 2014
Cited alongside, same era.
Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD . 75–86
Y. Tang, X. Xiao, and Y. Shi. 2014 · 2014
Cited alongside, same era.
Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In KDD . 1416–1425
Y. Yoshida. 2014 · 2014
Cited alongside, same era.
Influence Maximization in Near-Linear Time: A Martingale Approach. In SIGMOD . 1539–1554
Y. Tang, Y. Shi, and X. Xiao. 2015 · 2015
Cited alongside, same era.
Scalable Betweenness Centrality Maximization via Sampling. In KDD . 1765–1773
A. Mahmoody, C. E. Tsourakakis, and E. Upfal. 2016 · 2016
Cited alongside, same era.
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks. In SIGMOD . 695–710
H. T. Nguyen, M. T. Thai, and T. N. Dinh. 2016a
Cited in the paper.
A. McGregor and H. T. Vu. 2017 · 2017
Later among the works it cites.
Outward Influence and Cascade Size Estimation in Billion-scale Networks. In SIGMETRICS . 63–63
H. T. Nguyen, T. P. Nguyen, T. N. Vu, and T. N. Dinh. 2017 · 2017
Later among the works it cites.
Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach
J. Tang, X. Tang, and J. Yuan. 2017 · 2017
Later among the works it cites.
Optimal Distributed Submodular Optimization via Sketching. In SIGKDD . 1138–1147
M. Bateni, H. Esfandiari, and V. Mirrokni. 2018 · 2018
Later among the works it cites.
Online Processing Algorithms for Influence Maximization. In In SIGMOD . ACM, New York, NY, USA, 991–1005
J. Tang, X. Tang, X. Xiao, and J. Yuan. 2018 · 2018
Later among the works it cites.