Stochastic Submodular Maximization

被引:0
|
作者
Asadpour, Arash [1 ]
Nazerzadeh, Hamid [1 ]
Saberi, Amin [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
We study stochastic submodular maximization problem with respect to a cardinality constraint. Our model can capture the effect of uncertainty in different, problems, such as cascade effects in social networks, capital budgeting sensor placement, etc. We study non-adaptive and adaptive policies and give optimum constant approximation algorithms for both cases. We also bound the adaptivity gap of the problem between 1.21 and 1.59.
引用
收藏
页码:477 / 489
页数:13
相关论文
共 50 条
  • [21] Online Continuous Submodular Maximization
    Chen, Lin
    Hassani, Hamed
    Karbasi, Amin
    [J]. INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 84, 2018, 84
  • [22] Robust Sequence Submodular Maximization
    Sallam, Gamal
    Zheng, Zizhan
    Wu, Jie
    Ji, Bo
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [23] Robust Adaptive Submodular Maximization
    Tang, Shaojie
    [J]. INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 3277 - 3291
  • [24] The Power of Subsampling in Submodular Maximization
    Harshaw, Christopher
    Kazemi, Ehsan
    Feldman, Moran
    Karbasi, Amin
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2022, 47 (02) : 1365 - 1393
  • [25] Gradient Methods for Submodular Maximization
    Hassani, Hamed
    Soltanolkotabi, Mahdi
    Karbasi, Amin
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [26] Submodular Maximization by Simulated Annealing
    Gharan, Shayan Oveis
    Vondrak, Jan
    [J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1098 - 1116
  • [27] Practical Budgeted Submodular Maximization
    Moran Feldman
    Zeev Nutov
    Elad Shoham
    [J]. Algorithmica, 2023, 85 : 1332 - 1371
  • [28] Improved Inapproximability for Submodular Maximization
    Austrin, Per
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 12 - 24
  • [29] The FAST Algorithm for Submodular Maximization
    Breuer, Adam
    Balkanski, Eric
    Singer, Yaron
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [30] Online Submodular Maximization with Preemption
    Buchbinder, Niv
    Feldman, Moran
    Schwartz, Roy
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (03)