APA (7th ed.) Citation

Zhang, W., & Cheng, Y. (2020). A new upper bound on the work function algorithm for the k-server problem. Journal of combinatorial optimization, 39(2), 509-518. https://doi.org/10.1007/s10878-019-00493-z

Chicago Style (17th ed.) Citation

Zhang, Wenming, and Yongxi Cheng. "A New Upper Bound on the Work Function Algorithm for the K-server Problem." Journal of Combinatorial Optimization 39, no. 2 (2020): 509-518. https://doi.org/10.1007/s10878-019-00493-z.

MLA (9th ed.) Citation

Zhang, Wenming, and Yongxi Cheng. "A New Upper Bound on the Work Function Algorithm for the K-server Problem." Journal of Combinatorial Optimization, vol. 39, no. 2, 2020, pp. 509-518, https://doi.org/10.1007/s10878-019-00493-z.