Geometric clustering
From MaRDI portal
Publication:3189027
DOI10.1145/2000807.2000811zbMath1295.68129OpenAlexW2127518109MaRDI QIDQ3189027
Panos Giannopoulos, Christian Knauer, Günter Rote, Dániel Marx, Sergio Cabello
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2000807.2000811
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ Improved PTAS for the constrained \(k\)-means problem ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ Unnamed Item ⋮ Fixed-parameter complexity and approximability of norm maximization
This page was built for publication: Geometric clustering
