Decades-Old k-Server Conjecture Proven on arXiv

A new arXiv paper by Coester, Koutsoupias and Zbysiński proves the k-server conjecture, showing deterministic online algorithms achieve competitive ratio k on every metric space. It is part of a wave of long-standing open problems in theoretical computer science being solved.

2026-09-15 ~ 2026-09-16 · 3 related posts

• k-server Conjecture Proved, Closing a Classic Online Algorithms Open Problem — minilek · 2026-09-15
• k-server conjecture proven true: work function algorithm achieves competitive ratio k — ctjlewis · 2026-09-16

1 near-duplicate retellings: naval