Subquadratic approximation algorithms for clustering problems in high dimensional spaces
From MaRDI portal
Publication:5890867
DOI10.1145/301250.301367zbMath1345.62088MaRDI QIDQ5890867
Rafail Ostrovsky, Yuval Rabani, Allan Borodin
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301367
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68W25: Approximation algorithms
Related Items
Performance guarantees for hierarchical clustering, On computing the diameter of a point set in high dimensional Euclidean space., A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs