Catusse, N., Chepoi, V., Nouioua, K., & Vaxès, Y. (2012). Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica, 63(1-2), 551-567. https://doi.org/10.1007/s00453-011-9560-z
Chicago Style (17th ed.) CitationCatusse, N., V. Chepoi, K. Nouioua, and Y. Vaxès. "Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm." Algorithmica 63, no. 1-2 (2012): 551-567. https://doi.org/10.1007/s00453-011-9560-z.
MLA (9th ed.) CitationCatusse, N., et al. "Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm." Algorithmica, vol. 63, no. 1-2, 2012, pp. 551-567, https://doi.org/10.1007/s00453-011-9560-z.
Warning: These citations may not always be 100% accurate.