Hardness of \(k\)-anonymous microaggregation

DOI10.1016/J.DAM.2020.10.005OpenAlexW3096494388MaRDI QIDQ1983125

Florian Thaeter, K. Ruediger Reischuk

Publication date: 15 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.005

zbMATH Keywords

clustering\(k\)-anonymitymicroaggregation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Theory of data (68Pxx) Theory of computing (68Qxx)

Cites Work

• A polynomial-time approximation to optimal multivariate microaggregation
• A modification of the Lloyd algorithm for \(k\)-anonymous quantization
• The Planar k-Means Problem is NP-Hard
• Planar Formulae and Their Uses
• Least squares quantization in PCM

This page was built for publication: Hardness of \(k\)-anonymous microaggregation