On the Advice Complexity of the k-server Problem Under Sparse Metrics

Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz. On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst., 59(3):476-499, 2016. [doi]

@article{GuptaKL16,
  title = {On the Advice Complexity of the k-server Problem Under Sparse Metrics},
  author = {Sushmita Gupta and Shahin Kamali and Alejandro López-Ortiz},
  year = {2016},
  doi = {10.1007/s00224-015-9649-x},
  url = {http://dx.doi.org/10.1007/s00224-015-9649-x},
  researchr = {https://researchr.org/publication/GuptaKL16},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {59},
  number = {3},
  pages = {476-499},
}