Parameterized complexity of \(k\)-anonymity: hardness and tractability
type: Item
instance of: scholarly article
title: Parameterized complexity of \(k\)-anonymity: hardness and tractability
zbMATH Open document ID: 1300.90033
author: Paola Bonizzoni
author: Gianluca Della Vedova
author: Riccardo Dondi
author: Yuri Pirola
published in: Journal of Combinatorial Optimization
publication date: 2013-08-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6197008
zbMATH Keywords: anonymity
zbMATH Keywords: fixed-parameter complexity
zbMATH Keywords: approximation algorithms
zbMATH Keywords: hardness
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s10878-011-9428-9
OpenAlex ID: W3098107898
cites work: Database Theory - ICDT 2005
cites work: Achieving anonymity via clustering
cites work: Some APX-completeness results for cubic graphs
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: Q4258216
cites work: Resolving the Complexity of Some Data Privacy Problems
cites work: Anonymizing binary and small tables is hard to approximate
cites work: Q5315023
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
cites work: Fixed-parameter tractability of anonymizing data by suppressing entries
cites work: Q5710169
cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
DOI: 10.1007/S10878-011-9428-9
description: scientific article; zbMATH DE number 6197008