Achieving anonymity via clustering
From MaRDI portal
Publication:2930330
DOI10.1145/1798596.1798602zbMath1300.68023MaRDI QIDQ2930330
Rina Panigrahy, Gagan Aggarwal, Samir Khuller, Dilys Thomas, An Zhu, Krishnaram Kenthapadi, Tomás Feder
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.8529
68P15: Database theory
68P25: Data encryption (aspects in computer science)
68P20: Information storage and retrieval of data
68W25: Approximation algorithms
Related Items
Unnamed Item, Unnamed Item, Generalized Center Problems with Outliers, r-Gatherings on a star and uncertain r-gatherings on a line, A Simple Algorithm for $r$-gatherings on the Line, On Min-Max r-Gatherings, On the cost of essentially fair clusterings, Parameterized complexity of categorical clustering with size constraints, FPT Approximation for Constrained Metric k-Median/Means, Matroid and knapsack center problems, Attribute association based privacy preservation for multi trust level environment, Parameterized complexity of \(k\)-anonymity: hardness and tractability, Anonymizing binary and small tables is hard to approximate, On min-max \(r\)-gatherings, Clustering with lower-bounded sizes. A general graph-theoretic framework, Parameterized complexity of categorical clustering with size constraints, Towards the evaluation of time series protection methods, Faster balanced clusterings in high dimension, Approximation algorithms for the lower-bounded \(k\)-median and its generalizations, \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes, A unified framework for clustering constrained data without locality property, Using patterns to form homogeneous teams, A refined complexity analysis of degree anonymization in graphs, Improved PTAS for the constrained \(k\)-means problem, The effect of homogeneity on the computational complexity of combinatorial data anonymization, A linear time algorithm for the \(r\)-gathering problem on the line, Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier, Parameterized Complexity of k-Anonymity: Hardness and Tractability, The Effect of Homogeneity on the Complexity of k-Anonymity, On r-Gatherings on the Line
