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

标题
A new upper bound on the work function algorithm for the k-server problem
作者
关键词
-
出版物
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2019-11-28
DOI
10.1007/s10878-019-00493-z

向作者/读者发起求助以获取更多资源

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started