APA (7th ed.) Citation

Xiao, M., Cai, L., & Yao, A. C. (2011). Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica, 59(4), 510-520. https://doi.org/10.1007/s00453-009-9316-1

Chicago Style (17th ed.) Citation

Xiao, Mingyu, Leizhen Cai, and Andrew Chi-Chih Yao. "Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum K-Way Cut Problem." Algorithmica 59, no. 4 (2011): 510-520. https://doi.org/10.1007/s00453-009-9316-1.

MLA (9th ed.) Citation

Xiao, Mingyu, et al. "Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum K-Way Cut Problem." Algorithmica, vol. 59, no. 4, 2011, pp. 510-520, https://doi.org/10.1007/s00453-009-9316-1.