Sublinear time algorithms for metric space problems
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 428-434
- https://doi.org/10.1145/301250.301366
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Long tours and short superstringsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Subquadratic approximation algorithms for clustering problems in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1999
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Efficient methods for multiple sequence alignment with guaranteed error boundsBulletin of Mathematical Biology, 1993
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- e-approximations with minimum packing constraint violation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Scatter/Gather: a cluster-based approach to browsing large document collectionsPublished by Association for Computing Machinery (ACM) ,1992
- Worst-Case Analysis of Network Design Problem HeuristicsSIAM Journal on Algebraic Discrete Methods, 1980
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976