Cite
An almost optimal approximation algorithm for monotone submodular multiple knapsack.
MLA
Fairstein, Yaron, et al. “An Almost Optimal Approximation Algorithm for Monotone Submodular Multiple Knapsack.” Journal of Computer & System Sciences, vol. 125, May 2022, pp. 149–65. EBSCOhost, https://doi.org/10.1016/j.jcss.2021.11.005.
APA
Fairstein, Y., Kulik, A., Naor, J. (Seffi), Raz, D., & Shachnai, H. (2022). An almost optimal approximation algorithm for monotone submodular multiple knapsack. Journal of Computer & System Sciences, 125, 149–165. https://doi.org/10.1016/j.jcss.2021.11.005
Chicago
Fairstein, Yaron, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, and Hadas Shachnai. 2022. “An Almost Optimal Approximation Algorithm for Monotone Submodular Multiple Knapsack.” Journal of Computer & System Sciences 125 (May): 149–65. doi:10.1016/j.jcss.2021.11.005.