Pattern-Guided Data Anonymization and Clustering
From MaRDI portal
Publication:3088038
DOI10.1007/978-3-642-22993-0_19zbMath1343.68105OpenAlexW9743498MaRDI QIDQ3088038
Robert Bredereck, Rolf Niedermeier, André Nichterlein, Geevarghese Philip
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_19
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The \(l\)-diversity problem: tractability and approximability, The effect of homogeneity on the computational complexity of combinatorial data anonymization, Pattern-guided \(k\)-anonymity, The Effect of Homogeneity on the Complexity of k-Anonymity