Talk:K-server problem
Latest comment: 14 years ago by David Eppstein in topic Solution for k = 2 {\displaystyle k=2}
![]() | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
Solution for
editI believe Double-Cover is -competitive -- maybe somebody wants to add it to the page as a solution for ? --Jerome Baum (talk) 16:22, 3 December 2009 (UTC)
- [citation needed]. —David Eppstein (talk) 16:31, 3 December 2009 (UTC)