Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries

DOI10.1007/978-3-540-85097-7_3zbMath1168.68379OpenAlexW1499311240MaRDI QIDQ5505640

Rhonda Chaytor, Patricia A. Evans, Todd Wareham

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_3

Mathematics Subject Classification ID

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 (1)

Anonymizing binary and small tables is hard to approximate

Cites Work

• Unnamed Item
• Unnamed Item
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Database Theory - ICDT 2005

This page was built for publication: Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries