Subquadratic approximation algorithms for clustering problems in high dimensional spaces
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 435-444
- https://doi.org/10.1145/301250.301367
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The geometry of graphs and some of its algorithmic applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sparse partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Efficient search for approximate nearest neighbor in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992
- How to search in historyInformation and Control, 1985
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982