On the Complexity of Optimal K-Anonymity
Summary: Proves NP-hardness of two general formulations of optimal k-anonymity, including suppression (minimize deleted entries). Gives poly-time approximation algorithms: an O(k log k)-approx for constant k (runtime exponential in k) and an O(k log m)-approx removing that dependence on k. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Adam Meyerson (Carnegie Mellon University; University of California Los Angeles)
- 2. Ryan Williams (Carnegie Mellon University)
BibTeX Citation
@inproceedings{meyerson_pods04,
address = {New York, NY, USA},
series = {{PODS} '04},
title = {{On the Complexity of Optimal K-Anonymity}},
url = {https://dl.acm.org/doi/10.1145/1055558.1055591},
doi = {10.1145/1055558.1055591},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Meyerson, Adam and Williams, Ryan},
year = {2004}
}
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 70 | Privacy-Preserving Data Mining | 2000 | SIGMOD | 0.0003804755 |
| 123 | Revealing Information while Preserving Privacy | 2003 | PODS | 0.00031082693 |
| 218 | Limiting Privacy Breaches in Privacy Preserving Data Mining | 2003 | PODS | 0.00024420564 |
| 244 | On the Design and Quantification of Privacy Preserving Data Mining Algorithms | 2001 | PODS | 0.00023476901 |
| 338 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS | 0.00020731054 |
| 404 | Hippocratic Databases | 2002 | VLDB | 0.00019065022 |
| 2,017 | Auditing Boolean Attributes | 2000 | PODS | 9.3006188e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,875 | Privacy-Enhancing k-Anonymization of Customer Data | 2005 | PODS |
| 2 | 9,086 | Privacy Preservation by Disassociation | 2012 | VLDB |
| 3 | 985 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD |
| 4 | 450 | Incognito: Efficient Full-Domain K-Anonymity | 2005 | SIGMOD |
| 5 | 3,845 | Checking for k-Anonymity Violation by Views | 2005 | VLDB |
| 6 | 3,110 | Achieving Anonymity via Clustering | 2006 | PODS |
| 7 | 338 | Generalizing Data to Provide Anonymity when Disclosing Information | 1998 | PODS |
| 8 | 3,232 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB |
| 9 | 4,699 | Fast Data Anonymization with Low Information Loss | 2007 | VLDB |
| 10 | 6,554 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD |