American Psychological Association 6th edition

Cui, M., Xu, D., Guo, L., & Wu, D. (2022). Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. Journal of Combinatorial Optimization, 43(5), 1671-1690. https://doi.org/10.1007/s10878-021-00719-z

ISO-690 (author-date, English)

CUI, Min, XU, Dachuan, GUO, Longkun and WU, Dan, 2022. Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. Journal of Combinatorial Optimization. 1 July 2022. Vol. 43, no. 5, p. 1671-1690. DOI 10.1007/s10878-021-00719-z.

Modern Language Association 9th edition

Cui, M., D. Xu, L. Guo, and D. Wu. “Approximation Guarantees for Parallelized Maximization of Monotone Non-Submodular Function With a Cardinality Constraint”. Journal of Combinatorial Optimization, vol. 43, no. 5, July 2022, pp. 1671-90, https://doi.org/10.1007/s10878-021-00719-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Cui, Min/Xu, Dachuan/Guo, Longkun/Wu, Dan: Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint, Journal of Combinatorial Optimization 2022, 1671-1690.

Emerald - Harvard

Cui, M., Xu, D., Guo, L. and Wu, D. (2022), “Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint”, Journal of Combinatorial Optimization, Vol. 43 No. 5, pp. 1671-1690.

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