Xiao, H., Liu, Q., Zhou, Y., & Li, M. (2026). Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint. Journal of the Operations Research Society of China, 14(2), 397. https://doi.org/10.1007/s40305-024-00539-y
Chicago Style (17th ed.) CitationXiao, Hao, Qian Liu, Yang Zhou, and Min Li. "Approximation Algorithms for K-Submodular Maximization Subject to a Knapsack Constraint." Journal of the Operations Research Society of China 14, no. 2 (2026): 397. https://doi.org/10.1007/s40305-024-00539-y.
MLA (9th ed.) CitationXiao, Hao, et al. "Approximation Algorithms for K-Submodular Maximization Subject to a Knapsack Constraint." Journal of the Operations Research Society of China, vol. 14, no. 2, 2026, p. 397, https://doi.org/10.1007/s40305-024-00539-y.