The Effect of Homogeneity on the Complexity of k-Anonymity
From MaRDI portal
Publication:3088269
DOI10.1007/978-3-642-22953-4_5zbMath1342.68154MaRDI QIDQ3088269
Rolf Niedermeier, Robert Bredereck, André Nichterlein, Geevarghese Philip
Publication date: 19 August 2011
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_5
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
- Anonymizing binary and small tables is hard to approximate
- Fixed-parameter tractability of anonymizing data by suppressing entries
- Achieving anonymity via clustering
- Parameterized Complexity of k-Anonymity: Hardness and Tractability
- Pattern-Guided Data Anonymization and Clustering
- Reflections on Multivariate Algorithmics and Problem Parameterization
- Resolving the Complexity of Some Data Privacy Problems
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Database Theory - ICDT 2005
- The NP-completeness column: An ongoing guide