Author:
Li YuYing,Li Min,Zhou Yang,Liu Qian
Publisher
Springer Nature Switzerland
Reference22 articles.
1. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011). https://doi.org/10.1137/080733991
2. Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrainted submodular maximization. SIAM J. Comput. 44(5), 1384–1402 (2015). https://doi.org/10.1137/130929205
3. Sviridenko, M.: A note on maximizing a submodular set function to a knapsack constraint. Oper. Res. Lett. 32(1), 41–43 (2004). https://doi.org/10.1016/S0167-6377(03)00062-2
4. Singh, A., Guillory, A., Bilmes, J.: On bisubmodular maximization. In: AISTATS, vol. 22, pp. 1055–1063 (2012). https://proceedings.mlr.press/v22/singh12.html
5. Ward, J., Živný, S.: Maximizing $$k$$-submodular functions and beyond. ACM Trans. Algorithms 12(4), 1–26 (2016). https://doi.org/10.1145/2850419