Subquadratic approximation algorithms for clustering problems in high dimensional spaces

DOI10.1145/301250.301367zbMath1345.62088OpenAlexW2005983304MaRDI 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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Related Items (4)

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs ⋮ Performance guarantees for hierarchical clustering ⋮ On computing the diameter of a point set in high dimensional Euclidean space. ⋮ Towards a Theory of Intrusion Detection

This page was built for publication: Subquadratic approximation algorithms for clustering problems in high dimensional spaces