Author:
Gong Suning,Nong Qingqin,Sun Tao,Fang Qizhi,Du Dingzhu,Shao Xiaoyu
Funder
National Science Foundation
National Natural Science Foundation of China
Natural Science Foundation of Shandong Province
Fundamental Research Funds for the Central Universities
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Learning submodular functions;Balcan,2011
2. Guarantees for greedy maximization of non-submodular functions with applications;Bian;Int. Conf. Mach. Learn.,2017
3. Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem;Conforti;Discrete Appl. Math.,1984
4. Maximizing a submodular set function subject to a matroid constraint;Calinescu,2007
5. Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection;Das,2011
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献