Author:
Zhang Zhen-Ning,Du Dong-Lei,Ma Ran,Wu Dan
Funder
National Natural Science Foundation of China
the Natural Sciences and Engineering Research Council of Canada
the Province Natural Science Foundation of Shandong
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference16 articles.
1. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14, 265–294 (1978)
2. Svirdenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Letter 32, 41–43 (2004)
3. Svirdenko, M., Vondrák, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42, 1197–1218 (2017)
4. Feldman, M.: Guess free maximization of submodular and linear sums, In: Workshop on Algorithms and Data Structures, pp. 380-394 (2019)
5. Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications, In: Proceedings of ICML, pp. 2634-2643 (2019)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献