Author:
Asadpour Arash,Nazerzadeh Hamid,Saberi Amin
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307–328 (2004)
2. Ahmed, S., Atamtürk, A.: Maximizing a class of submodular utility functions. Research Report BCOL.08.02, IEOR, University of California-Berkeley (March 2008)
3. Chan, C., Farias, V.: Stochastic depletion problems: Effective myopic policies for a class of dynamic optimization problems (manuscript, 2008)
4. Cornuejols, G., Fisher, M., Nemhauser, G.: Location of bank accounts to optimize float. Management Science 23, 789–810 (1977)
5. Dean, B.C., Goemans, M.X., Vondrák, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: FOCS, pp. 208–217 (2004)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stochastic Probing with Increasing Precision;SIAM Journal on Discrete Mathematics;2024-01-08
2. High Probability Guarantees for Submodular Maximization via Boosted Stochastic Greedy;2023 57th Asilomar Conference on Signals, Systems, and Computers;2023-10-29
3. Relative Entropy Regularization for Robust Submodular Multi-Task Subset Selection;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26
4. Stochastic Submodular Maximization via Polynomial Estimators;Advances in Knowledge Discovery and Data Mining;2023
5. Robust Adaptive Submodular Maximization;INFORMS Journal on Computing;2022-11