The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6259864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The effect of homogeneity on the computational complexity of combinatorial data anonymization |
scientific article; zbMATH DE number 6259864 |
Statements
The effect of homogeneity on the computational complexity of combinatorial data anonymization (English)
0 references
19 February 2014
0 references
\(k\)-anonymity
0 references
\(p\)-sensitivity
0 references
\(\ell\)-diversity
0 references
domain generalization hierarchies
0 references
matrix modification problems
0 references
parameterized algorithmics
0 references
fixed-parameter tractability
0 references
NP-hardness
0 references
0 references
0 references
0.9651309847831726
0 references
0.8620089888572693
0 references
0.8577687740325928
0 references
0.8385772109031677
0 references
0.835355818271637
0 references
