Hardness of k-anonymous microaggregation

DOI10.1016/J.DAM.2020.10.005OpenAlexW3096494388MaRDI QIDQ1983125FDOQ1983125

Rüdiger Reischuk, Florian Thaeter

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)

Cites Work

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

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)