Author:
Chang Hong,Jin Jing,Liu Zhicheng,Du Donglei,Zhang Xiaoyan
Funder
Natural Sciences and Engineering Research Council of Canada
National Natural Science Foundation of China
Natural Science Foundation of Jiangsu Province
Qinglan Project of Jiangsu Province of China
Reference16 articles.
1. Greed is still good: maximizing monotone submodular+supermodular (BP) functions;Bai,2018
2. Learning sparse combinatorial representations via two-stage submodular maximization;Balkanski,2016
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. An analysis of approximations for maximizing submodular set functions–ii;Fisher;Polyhedral Combinator.,1978
5. Near-optimal nonmyopic value of information in graphical models;Krause,2005