American Psychological Association 6th edition

Zhou, J., Ran, Y., Pardalos, P. M., Zhang, Z., Tang, S., & Du, D.-Z. (2025). A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set. INFORMS Journal on Computing, 37(4), 1106-1120. https://doi.org/10.1287 joc.2023.0306

ISO-690 (author-date, English)

ZHOU, Jiao, RAN, Yingli, PARDALOS, Panos M., ZHANG, Zhao, TANG, Shaojie und DU, Ding-Zhu, 2025. A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set. INFORMS Journal on Computing. 1 Juli 2025. Vol. 37, no. 4, p. 1106-1120. DOI 10.1287 joc.2023.0306.

Modern Language Association 9th edition

Zhou, J., Y. Ran, P. M. Pardalos, Z. Zhang, S. Tang, und D.-Z. Du. „A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set.“. INFORMS Journal on Computing, Bd. 37, Nr. 4, Juli 2025, S. 1106-20, https://doi.org/10.1287 joc.2023.0306.

Mohr Siebeck - Recht (Deutsch - Österreich)

Zhou, Jiao/Ran, Yingli/Pardalos, Panos M./Zhang, Zhao/Tang, Shaojie/Du, Ding-Zhu: A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set., INFORMS Journal on Computing 2025, 1106-1120.

Emerald - Harvard

Zhou, J., Ran, Y., Pardalos, P.M., Zhang, Z., Tang, S. und Du, D.-Z. (2025), „A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set.“, INFORMS Journal on Computing, Vol. 37 No. 4, S. 1106-1120.

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