Sign in
Private Approximation of Clustering and Vertex Cover.
Amos Beimel
Renen Hallak
Kobbi Nissim
Published in:
Comput. Complex. (2009)
Keyphrases
</>
vertex cover
approximation algorithms
polynomial time approximation
k means
np hard
approximation ratio
clustering algorithm
worst case
graphical models
closed form
minimum cost
partial order
precedence constraints
data points
error bounds
density estimation
approximation guarantees
special case