Funder
NSFC
Natural Science Foundation of Jiangsu Province
Jiangsu Province Higher Education Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference13 articles.
1. Balkanski E, Krause A, Mirzasoleiman B, Singer Y (2016) Learning sparse combinatorial representations via two-stage submodular maximization. In ICML, pp 2207–2216
2. Conforti M, Cornuejols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discr Appl Math 7(3):251–274
3. Fisher M L, Nemhauser G L, Wolsey L A (1978) An analysis of approximations for maximizing submodular set functions–ii. Polyhedral combinatorics, pp 73–87
4. Feldman M, Naor J, Schwartz R, Ward J (2011) Improved approximations for k-exchange systems. In: Proceedings of ESA, pp 784–798
5. Krause A, Guestrin A (2005) Near-optimal nonmyopic value of information in graphical models. In UAI, 5
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献