Author:
Chen Ling,Liu Zhicheng,Chang Hong,Du Donglei,Zhang Xiaoyan
Publisher
Springer International Publishing
Reference16 articles.
1. Lecture Notes in Computer Science;Y Azar,2011
2. Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+supermodular (BP) functions. In: Proceedings of ICML, pp. 304–313 (2018)
3. Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: Proceedings of SODA, pp. 1202–1216 (2015)
4. Conforti, M., Cornuejols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Appl. Math. 7(3), 251–274 (1984)
5. Dughmi, S., Roughgarden, T., Sundararajan, M.: Revenue submodularity. In: Proceedings of EC, pp. 243–252 (2009)