Author:
Chang Hong,Jin Jing,Liu Zhicheng,Li Ping,Zhang Xiaoyan
Subject
General Computer Science,Theoretical Computer Science
Reference13 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. Guarantees for greedy maximization of non-submodular functions with applications;Bian,2017
4. 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
5. Maximize a monotone function with a generic submodularity ratio;Gong;Theor. Comput. Sci.,2021