Cite
Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants.
MLA
Huang, Liting, et al. “Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants.” Algorithmica, vol. 86, no. 4, Apr. 2024, pp. 1135–62. EBSCOhost, https://doi.org/10.1007/s00453-023-01187-z.
APA
Huang, L., Yu, W., & Liu, Z. (2024). Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants. Algorithmica, 86(4), 1135–1162. https://doi.org/10.1007/s00453-023-01187-z
Chicago
Huang, Liting, Wei Yu, and Zhaohui Liu. 2024. “Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants.” Algorithmica 86 (4): 1135–62. doi:10.1007/s00453-023-01187-z.