Database Theory - ICDT 2005
From MaRDI portal
Publication:5316598
DOI10.1007/b104421zbMath1112.68360OpenAlexW4232873349MaRDI QIDQ5316598
Krishnaram Kenthapadi, Gagan Aggarwal, An Zhu, Rina Panigrahy, Rajeev Motwani, Tomás Feder
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104421
Database theory (68P15) Data encryption (aspects in computer science) (68P25) Approximation algorithms (68W25)
Related Items (11)
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem ⋮ Parameterized complexity of \(k\)-anonymity: hardness and tractability ⋮ The \(l\)-diversity problem: tractability and approximability ⋮ Finding all maximally-matchable edges in a bipartite graph ⋮ A practical approximation algorithm for optimal \(k\)-anonymity ⋮ 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 ⋮ Anonymizing binary and small tables is hard to approximate ⋮ The Effect of Homogeneity on the Complexity of k-Anonymity ⋮ Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
This page was built for publication: Database Theory - ICDT 2005
