Author:
Liu Zhicheng,Jin Jing,Du Donglei,Zhang Xiaoyan
Publisher
Springer International Publishing
Reference18 articles.
1. Balkanski, E., Mirzasoleiman, B., Krause, A., Singer, Y.: Learning sparse combinatorial representations via two-stage submodular maximization. In: ICML, pp. 2207–2216 (2016)
2. Buchbinder, N., Feldman, M., Filmus, Y., Garg, M.: Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1), 149–169 (2020). https://doi.org/10.1007/s10107-019-01459-z
3. Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384–1402 (2015)
4. Calinescu, G., Chekuri, C., Pal, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)
5. Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC, pp. 71–78 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献