Pages that link to "Item:Q2930330"

The following pages link to Achieving anonymity via clustering (Q2930330):

Displaying 44 items.

• Matroid and knapsack center problems (Q300451) (← links)
• Attribute association based privacy preservation for multi trust level environment (Q301772) (← links)
• Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
• Publishing anonymous survey rating data (Q408666) (← links)
• Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
• On min-max \(r\)-gatherings (Q627109) (← links)
• Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
• Efficient systematic clustering method for \(k\)-anonymization (Q766161) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
• Towards the evaluation of time series protection methods (Q833741) (← links)
• A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← links)
• Generalized bucketization scheme for flexible privacy settings (Q1991860) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
• \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes (Q2232242) (← links)
• A weighted K-member clustering algorithm for K-anonymization (Q2244050) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Using patterns to form homogeneous teams (Q2346970) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• A modification of the Lloyd algorithm for \(k\)-anonymous quantization (Q2510470) (← links)
• A linear time algorithm for the \(r\)-gathering problem on the line (Q2662686) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
• Pattern-Guided Data Anonymization and Clustering (Q3088038) (← links)
• The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
• On r-Gatherings on the Line (Q3452549) (← links)
• A privacy-preserving clustering model based on density (Q4926663) (← links)
• Generalized Center Problems with Outliers (Q4972687) (← links)
• Generalized center problems with outliers (Q5002700) (← links)
• (Q5002778) (← links)
• r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
• A Simple Algorithm for $r$-gatherings on the Line (Q5240371) (← links)
• On Min-Max r-Gatherings (Q5443378) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• (k, l)-Clustering for Transactional Data Streams Anonymization (Q6163694) (← links)
• The fair \(k\)-center with outliers problem: FPT and polynomial approximations (Q6535817) (← links)
• Variants of Euclidean \(k\)-center clusterings (Q6591472) (← links)
• Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem (Q6636095) (← links)
• The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space (Q6658308) (← links)