Zhou, M., Zhang, Z., & Du, D.-Z. (2024). Approximation algorithm for prize-collecting vertex cover with fairness constraints. Journal of Combinatorial Optimization, 48(3). https://doi.org/10.1007/s10878-024-01215-w
ISO-690 (author-date, English)ZHOU, Mingchao, ZHANG, Zhao und DU, Ding-Zhu, 2024. Approximation algorithm for prize-collecting vertex cover with fairness constraints. Journal of Combinatorial Optimization. 1 Oktober 2024. Vol. 48, no. 3, . DOI 10.1007/s10878-024-01215-w.
Modern Language Association 9th editionZhou, M., Z. Zhang, und D.-Z. Du. „Approximation Algorithm for Prize-Collecting Vertex Cover With Fairness Constraints“. Journal of Combinatorial Optimization, Bd. 48, Nr. 3, Oktober 2024, https://doi.org/10.1007/s10878-024-01215-w.
Mohr Siebeck - Recht (Deutsch - Österreich)Zhou, Mingchao/Zhang, Zhao/Du, Ding-Zhu: Approximation algorithm for prize-collecting vertex cover with fairness constraints, Journal of Combinatorial Optimization 2024,
Emerald - HarvardZhou, M., Zhang, Z. und Du, D.-Z. (2024), „Approximation algorithm for prize-collecting vertex cover with fairness constraints“, Journal of Combinatorial Optimization, Vol. 48 No. 3, verfügbar unter:https://doi.org/10.1007/s10878-024-01215-w.