Private approximation of clustering and vertex cover

DOI10.1007/S00037-009-0259-3zbMath1213.68307OpenAlexW2096382750MaRDI 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

Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Two Party Distribution Testing: Communication and Security

This page was built for publication: Private approximation of clustering and vertex cover