Hardness of k-anonymous microaggregation

DOI10.1016/J.DAM.2020.10.005MaRDI QIDQ1983125zbMATH OpenOpenAlexFDO

Authors Florian Thaeter, Rüdiger 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

clusteringmicroaggregation\(k\)-anonymity

Mathematics Subject Classification ID

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

Recommendations

• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• The k-Anonymity Problem Is Hard
• The effect of homogeneity on the complexity of \(k\)-anonymity
• A practical approximation algorithm for optimal \(k\)-anonymity
• On distributed \(k\)-anonymization

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983125)