Metraipolis › archive › dc_ceb159f0dd6c
The Harmonic Online $k$-Server Algorithm Is Poly(k)-Competitive — arXiv:2611.05669
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05669
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:31:30.793Z
- SHA-256 of the archived text
128383e0f55e34a7a15fd77175f5ae4a431c67cb0ad29d7bd64d50eaf1d4d744- Stable URL of this page
https://metraipolis.com/documento/dc_ceb159f0dd6c
How to cite
The Harmonic Online $k$-Server Algorithm Is Poly(k)-Competitive — arXiv:2611.05669 — arXiv (en), https://arxiv.org/abs/2611.05669 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ceb159f0dd6c (Metraipolis archive dc_ceb159f0dd6c, sha256 128383e0f55e34a7a15fd77175f5ae4a431c67cb0ad29d7bd64d50eaf1d4d744)
BibTeX
@misc{dcceb159f0dd6c,
title = {The Harmonic Online $k$-Server Algorithm Is Poly(k)-Competitive — arXiv:2611.05669},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05669},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ceb159f0dd6c; sha256 128383e0f55e34a7a15fd77175f5ae4a431c67cb0ad29d7bd64d50eaf1d4d744},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05669. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The online $k$-server problem is one of the most fundamental problems in online algorithms. In this problem, $k$ servers are located in a metric space and serve a sequence of requests at points in the metric space by moving a server there. The Harmonic algorithm is a very natural algorithm: it chooses a server with probability inversely proportional to its distance from the request. It is also highly efficient, being memoryless and answering each request in $O(k)$ time. However, its competitive ratio has remained unsettled between the $O(2^k \log k)$ upper bound (Bartal and Grove, JACM 2000) and the $k(k+1)/2$ lower bound (Raghavan and Snir, 1994, IBM J. Res. Dev.). We prove that Harmonic is $2k^4$-competitive on every metric space against adaptive online adversaries. Our analysis uses a potential combining corrected electrical energy with the distances of online servers to their assigned adversary locations. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2611.05669 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-05T18:21:04.021Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).