Clustering with Diversity

DOI10.1007/978-3-642-14165-2_17zbMath1287.68182OpenAlexW1836068669MaRDI QIDQ3587379

Qin Zhang, Jian Li, Ke Yi

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_17

zbMATH Keywords

approximation algorithm\(k\)-anonymity\(k\)-center\(l\)-diversity

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Matroid and knapsack center problems ⋮ The \(l\)-diversity problem: tractability and approximability ⋮ An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems ⋮ Improved PTAS for the constrained \(k\)-means problem ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Unnamed Item ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ On the cost of essentially fair clusterings ⋮ A unified framework for clustering constrained data without locality property