American Psychological Association 6th edition

Xiao, H., Liu, Q., Zhou, Y., & Li, M. (2024). Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint. Journal of the Operations Research Society of China, 1-16. https://doi.org/10.1007/s40305-024-00539-y

ISO-690 (author-date, English)

XIAO, Hao, LIU, Qian, ZHOU, Yang and LI, Min, 2024. Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint. Journal of the Operations Research Society of China. 23 September 2024. P. 1-16. DOI 10.1007/s40305-024-00539-y.

Modern Language Association 9th edition

Xiao, H., Q. Liu, Y. Zhou, and M. Li. “Approximation Algorithms for K-Submodular Maximization Subject to a Knapsack Constraint”. Journal of the Operations Research Society of China, Sept. 2024, pp. 1-16, https://doi.org/10.1007/s40305-024-00539-y.

Mohr Siebeck - Recht (Deutsch - Österreich)

Xiao, Hao/Liu, Qian/Zhou, Yang/Li, Min: Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint, Journal of the Operations Research Society of China 2024, 1-16.

Emerald - Harvard

Xiao, H., Liu, Q., Zhou, Y. and Li, M. (2024), “Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint”, Journal of the Operations Research Society of China, pp. 1-16.

Warning: These citations may not always be 100% accurate.