Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of \(k\)-anonymity: hardness and tractability |
scientific article |
Statements
Parameterized complexity of \(k\)-anonymity: hardness and tractability (English)
0 references
9 August 2013
0 references
anonymity
0 references
fixed-parameter complexity
0 references
approximation algorithms
0 references
hardness
0 references
0 references
0 references
