Private approximation of clustering and vertex cover

DOI10.1007/s00037-009-0259-3zbMath1213.68307MaRDI QIDQ626661

Kobbi Nissim, Amos Beimel, Renen Hallak

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0259-3

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

94A60: Cryptography

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)