Daniel Sleator

New Capabilities

Posed the conjecture in 1988

A paper posted to arXiv on September 14 claims to settle the k-server conjecture, a problem in theoretical computer science open since 1988. Authors Christian Coester, Elias Koutsoupias, and Marek Zbysiński say they have proven that the Work Function Algorithm achieves the optimal competitive ratio of k on every metric space.

Updated 9 hours ago