Talk:K-server problem

Solution for $k=2$

I believe Double-Cover is $k$-competitive -- maybe somebody wants to add it to the page as a solution for $k=2$? --Jerome Baum (talk) 16:22, 3 December 2009 (UTC)

[citation needed]. —David Eppstein (talk) 16:31, 3 December 2009 (UTC)