Related references
Note: Only part of the references are listed.Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks
Song Bian et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2020)
Efficient Approximation Algorithms for Adaptive Target Profit Maximization
Keke Huang et al.
2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020) (2020)
Efficient Approximation Algorithms for Adaptive Seed Minimization
Jing Tang et al.
SIGMOD '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (2019)
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
Maxim Sviridenko et al.
MATHEMATICS OF OPERATIONS RESEARCH (2017)
Maximizing the Influence and Profit in Social Networks
Yuqing Zhu et al.
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2017)
Revisiting the Stop-and-Stare Algorithms for Influence Maximization
Keke Huang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2017)
SUBMODULAR FUNCTION MAXIMIZATION VIA THE MULTILINEAR RELAXATION AND CONTENTION RESOLUTION SCHEMES
Chandra Chekuri et al.
SIAM JOURNAL ON COMPUTING (2014)
Analytical Approach to Parallel Repetition
Irit Dinur et al.
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING (2014)
Influence and Profit: Two Sides of the Coin
Yuqing Zhu et al.
2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) (2013)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
Niv Buchbinder et al.
2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2012)
A note on maximizing a submodular set function subject to a knapsack constraint
M Sviridenko
OPERATIONS RESEARCH LETTERS (2004)
Share Paper
