Publisher
Springer Nature Switzerland
Reference24 articles.
1. Balkanski, E., Rubinstein, A., Singer, Y.: An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. In: 51st STOC, pp. 66–77. ACM (2019)
2. Balkanski, E., Rubinstein, A., Singer, Y.: An exponential speedup in parallel running time for submodular maximization without loss in approximation. In: 30th SODA, pp. 283–302. ACM-SIAM (2019)
3. Balkanski, E., Singer, Y.: The adaptive complexity of maximizing a submodular function. In: 50th STOC, pp. 1138–1151. ACM (2018)
4. Balkanski, E., Singer, Y.: Approximation guarantees for adaptive sampling. In: 35th ICML, pp. 384–393. PMLR (2018)
5. Breuer, A., Balkanski, E., Singer, Y.: The FAST algorithm for submodular maximization. In: 37th ICML, pp. 1134–1143. PMLR (2020)