On the complexity of optimal K-anonymity
PODS, pp. 223-228, 2004.
data integrityoptimal k-anonymityapproximation ratiooptimal k-anonymizationclever algorithmMore(5+)
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number ...More