American Psychological Association 6th edition

Liang, W., Tang, S., & Zhang, Z. (2025). Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage. Mathematical Programming: A Publication of the Mathematical Optimization Society, 1-36. https://doi.org/10.1007/s10107-025-02275-4

ISO-690 (author-date, English)

LIANG, Wei, TANG, Shaojie und ZHANG, Zhao, 2025. Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage. Mathematical Programming: A Publication of the Mathematical Optimization Society. 26 August 2025. P. 1-36. DOI 10.1007/s10107-025-02275-4.

Modern Language Association 9th edition

Liang, W., S. Tang, und Z. Zhang. „Approximation Algorithm for Unrooted Prize-Collecting Forest With Multiple Components and Its Application on Prize-Collecting Sweep Coverage“. Mathematical Programming: A Publication of the Mathematical Optimization Society, August 2025, S. 1-36, https://doi.org/10.1007/s10107-025-02275-4.

Mohr Siebeck - Recht (Deutsch - Österreich)

Liang, Wei/Tang, Shaojie/Zhang, Zhao: Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage, Mathematical Programming: A Publication of the Mathematical Optimization Society 2025, 1-36.

Emerald - Harvard

Liang, W., Tang, S. und Zhang, Z. (2025), „Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage“, Mathematical Programming: A Publication of the Mathematical Optimization Society, S. 1-36.

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