American Psychological Association 6th edition

Gong, S.-F., Liu, B., & Fang, Q.-Z. (2024). Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint. Journal of the Operations Research Society of China, 1-19. https://doi.org/10.1007/s40305-024-00544-1

ISO-690 (author-date, English)

GONG, Shu-Fang, LIU, Bin und FANG, Qi-Zhi, 2024. Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint. Journal of the Operations Research Society of China. 18 Juni 2024. P. 1-19. DOI 10.1007/s40305-024-00544-1.

Modern Language Association 9th edition

Gong, S.-F., B. Liu, und Q.-Z. Fang. „Streaming Algorithms for Maximizing K-Submodular Functions With the Multi-Knapsack Constraint“. Journal of the Operations Research Society of China, Juni 2024, S. 1-19, https://doi.org/10.1007/s40305-024-00544-1.

Mohr Siebeck - Recht (Deutsch - Österreich)

Gong, Shu-Fang/Liu, Bin/Fang, Qi-Zhi: Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint, Journal of the Operations Research Society of China 2024, 1-19.

Emerald - Harvard

Gong, S.-F., Liu, B. und Fang, Q.-Z. (2024), „Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint“, Journal of the Operations Research Society of China, S. 1-19.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.