A new upper bound on the work function algorithm for the k-server problem

Wenming Zhang, Yongxi Cheng. A new upper bound on the work function algorithm for the k-server problem. J. Comb. Optim., 39(2):509-518, 2020. [doi]

@article{ZhangC20-3,
  title = {A new upper bound on the work function algorithm for the k-server problem},
  author = {Wenming Zhang and Yongxi Cheng},
  year = {2020},
  doi = {10.1007/s10878-019-00493-z},
  url = {https://doi.org/10.1007/s10878-019-00493-z},
  researchr = {https://researchr.org/publication/ZhangC20-3},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {39},
  number = {2},
  pages = {509-518},
}