k-server via multiscale entropic regularization
© 2018 Copyright held by the owner/author(s). We present an O((log k)2)-competitive randomized algorithm for the k-server problem on hierarchically separated trees (HSTs). This is the first o(k)-competitive randomized algorithm for which the competitive ratio is independent of the size of the underl...
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Association for Computing Machinery (ACM)
2021
|
| 在线阅读: | https://hdl.handle.net/1721.1/137726 |