Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized complexity of k-anonymity: hardness and tractability |
scientific article; zbMATH DE number 6197008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of \(k\)-anonymity: hardness and tractability |
scientific article; zbMATH DE number 6197008 |
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
0.9947787523269652
0 references
0.9138630032539368
0 references
0.9134154915809632
0 references
0.9102596640586852
0 references
0.889938235282898
0 references
