Funder
national natural science foundation of china
fundamental research funds for the central universities
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications,Business, Management and Accounting (miscellaneous)
Reference37 articles.
1. Ageev, A., Hassin, R., Sviridenko, M.: A 0.5-approximation algorithm for max dicut with given sizes of parts. SIAM J. Discret. Math. 14(2), 246–255 (2001)
2. Bai, W., Bilmes, J.: Greed is still good: maximizing monotone submodular + supermodular (bp) functions. In: International Conference on Machine Learning, pp. 304–313. PMLR (2018)
3. Brualdi, R.A.: Comments on bases in dependence structures. Bull. Aust. Math. Soc. 1(2), 161–167 (1969)
4. Calinescu, G., Chekuri, C., Pal, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)
5. Chekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831–1879 (2014)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献