Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference26 articles.
1. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions—I. Math. Program. 14(1), 265–294 (1978)
2. Goldengorin, B., Tijssen, G.A., Tso, M.: The maximization of submodular functions: old and new proofs for the correctness of the dichotomy algorithm. Unpublished manuscript, https://pure.rug.nl/ws/portalfiles/portal/3156943/99a17.pdf (1999)
3. Goldengorin, B.: Maximization of submodular functions: theory and enumeration algorithms. Eur. J. Oper. Res. 198(1), 102–112 (2009)
4. Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177–188 (1978)
5. Feige, U.: A threshold of $$\ln n$$ for approximating set cover. J. ACM 45(4), 634–652 (1998)