Fixed-parameter tractability of anonymizing data by suppressing entries

DOI10.1007/s10878-009-9253-6zbMath1184.90135OpenAlexW2797479689MaRDI QIDQ849143

Rhonda Chaytor, Patricia A. Evans, H. Todd Wareham

Publication date: 24 February 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9253-6

zbMATH Keywords

privacyparameterized complexitykernelization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (8)

Parameterized complexity of \(k\)-anonymity: hardness and tractability ⋮ The \(l\)-diversity problem: tractability and approximability ⋮ The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ \(k\)-attribute-anonymity is hard even for \(k=2\) ⋮ Parameterized Complexity of k-Anonymity: Hardness and Tractability ⋮ Pattern-guided \(k\)-anonymity ⋮ The Effect of Homogeneity on the Complexity of k-Anonymity ⋮ A refined complexity analysis of degree anonymization in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A combinatorial problem in database security
• A Fast Algorithm for Generating Set Partitions
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION

This page was built for publication: Fixed-parameter tractability of anonymizing data by suppressing entries