Login / Signup
Parameterized Complexity of the k-anonymity Problem
Paola Bonizzoni
Gianluca Della Vedova
Riccardo Dondi
Yuri Pirola
Published in:
CoRR (2009)
Keyphrases
</>
parameterized complexity
information loss
privacy protection
privacy preserving
fixed parameter tractable
attribute values
global constraints
np hard
computational problems
symmetry breaking
np complete
relational data