Author:
Buchbinder Niv,Feldman Moran,Filmus Yuval,Garg Mohit
Publisher
Springer International Publishing
Reference32 articles.
1. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA, pp. 1253–1264 (2011)
2. Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: EC, pp. 18–35 (2012)
3. Badanidiyuru, A., Vondrák, J.: Fast algorithms for maximizing submodular functions. In: SODA, pp. 1497–1514 (2014)
4. Buchbinder, N., Feldman, M., Filmus, Y., Garg, M.: Online submodular maximization: Beating 1/2 made simple. CoRR abs/1807.05529 (2018).
http://arxiv.org/abs/1807.05529
5. Buchbinder, N., Feldman, M., Garg, M.: Deterministic
$$({1}/{2}+\varepsilon )$$
-approximation for submodular maximization over a matroid. In: SODA, pp. 241–254 (2019)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献