importantSYS.SOURCE: arXiv• 2026-09-15T07:45:31Z
Proof of the k-server Conjecture via Work Function Algorithm
The k-server conjecture, which posits a deterministic online algorithm can achieve a competitive ratio of k on any metric space, has been proven using the work function algorithm. The proof employs an algebraic matrix representation of the work function, leveraging matrix operations and a potential function for amortized analysis.
*** END OF TRANSMISSION ***