Parameterized complexity of k-anonymity: hardness and tractability.
Paola BonizzoniGianluca Della VedovaRiccardo DondiYuri PirolaPublished in: J. Comb. Optim. (2013)
Keyphrases
- parameterized complexity
- fixed parameter tractable
- np complete
- np hard
- information loss
- computational problems
- privacy preserving
- privacy protection
- computational complexity
- bounded treewidth
- attribute values
- global constraints
- conjunctive queries
- constraint satisfaction problems
- constraint satisfaction
- phase transition
- abstract argumentation
- decision problems
- integer linear programming
- vertex set