Private Approximation of Clustering and Vertex Cover.

Amos Beimel Renen Hallak Kobbi Nissim

Published in: TCC (2007)

Keyphrases

vertex cover
approximation algorithms
polynomial time approximation
clustering algorithm
k means
approximation ratio
np hard
worst case
data points
error bounds
precedence constraints
graph cuts
em algorithm
partial order
density estimation