Parameterized complexity of k-anonymity: hardness and tractability
DOI10.1007/978-3-642-19222-7_25zbMATH Open1326.68155OpenAlexW4254264926MaRDI QIDQ3000512FDOQ3000512
Authors: Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Paola Bonizzoni 
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_25
Recommendations
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Fixed-parameter tractability of anonymizing data by suppressing entries
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
- The k-Anonymity Problem Is Hard
- The effect of homogeneity on the complexity of \(k\)-anonymity
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Achieving anonymity via clustering
- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
- Resolving the Complexity of Some Data Privacy Problems
- Database Theory - ICDT 2005
- Fixed-parameter tractability of anonymizing data by suppressing entries
- k-Anonymization with Minimal Loss of Information
- Experimental and Efficient Algorithms
- The k-Anonymity Problem Is Hard
Cited In (13)
- The \(l\)-diversity problem: tractability and approximability
- Hardness of \(k\)-anonymous microaggregation
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
- Privacy in elections: \(k\)-anonymizing preference orders
- The k-Anonymity Problem Is Hard
- On the complexity of the \(l\)-diversity problem
- The effect of homogeneity on the complexity of \(k\)-anonymity
- A fixed-parameter approach for privacy-protection with global recoding
- \(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
- Fixed-parameter tractability of anonymizing data by suppressing entries
This page was built for publication: Parameterized complexity of \(k\)-anonymity: hardness and tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000512)
