k-Anonymization with Minimal Loss of Information

DOI10.1007/978-3-540-75520-3_40zbMath1151.68394OpenAlexW1657141322MaRDI QIDQ3527233

Aristides Gionis, Tamir Tassa

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_40

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

A practical approximation algorithm for optimal \(k\)-anonymity ⋮ The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ Parameterized Complexity of k-Anonymity: Hardness and Tractability ⋮ Anonymizing binary and small tables is hard to approximate

This page was built for publication: k-Anonymization with Minimal Loss of Information