Fixed-parameter tractability of anonymizing data by suppressing entries
From MaRDI portal
Publication:849143
DOI10.1007/s10878-009-9253-6zbMath1184.90135MaRDI 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
90C27: Combinatorial optimization
Related Items
Parameterized complexity of \(k\)-anonymity: hardness and tractability, The \(l\)-diversity problem: tractability and approximability, \(k\)-attribute-anonymity is hard even for \(k=2\), Pattern-guided \(k\)-anonymity, A refined complexity analysis of degree anonymization in graphs, The effect of homogeneity on the computational complexity of combinatorial data anonymization, Parameterized Complexity of k-Anonymity: Hardness and Tractability, The Effect of Homogeneity on the Complexity of k-Anonymity
Cites Work