Pattern-Guided k-Anonymity

DOI10.1007/978-3-642-38756-2_35zbMath1303.68059OpenAlexW2408059618MaRDI QIDQ5405946

Robert Bredereck, Rolf Niedermeier, André Nichterlein

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

\(k\)-attribute-anonymity is hard even for \(k=2\) ⋮ Pattern-guided \(k\)-anonymity ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ Using patterns to form homogeneous teams

This page was built for publication: Pattern-Guided k-Anonymity