Fault tolerant K-center problems

By Khuller  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 237-245

Elsevier

Access to resources Recommend Favorite

A framework for statistical clustering with constant time approximation algorithms for K -median and K -means clustering

By Ben-David Shai  

Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. : 243-257

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for k-hurdle Problems

By Dean Brian   Griffis Adam   Parekh Ojas   Whitley Adam  

Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. : 81-93

Springer Publishing Company

Access to resources Recommend Favorite

Hubness-aware shared neighbor distances for high-dimensional [TEX equation: k] -nearest neighbor classification

By Tomašev Nenad   Mladenić Dunja  

Knowledge and Information Systems, Vol. 39, Iss. 1, 2014-04 ,pp. : 89-122

Springer Publishing Company

Access to resources Recommend Favorite

k-server problems with bulk requests: an application to tool switching in manufacturing

By Privault Caroline   Finke Gerd  

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 255-269

Springer Publishing Company

Access to resources Recommend Favorite