Reductions among high dimensional proximity problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 769-778

  Goel, Ashish ^a   Indyk, Piotr ^b   Varadarajan, Kasturi ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF IOWA   (United States)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049086799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Sunil Arya , David M. Mount , Nathan S. Netanyahu , Ruth Silverman , Angela Wu, An optimal algorithm for approximate nearest neighbor searching, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.573-582, January 23-25, 1994, Arlington, Virginia, United States
2. Allan Borodin , Rafail Ostrovsky , Yuval Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.435-444, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/ 301250.301367]
3. Moses Charikar , Sudipto Guha, Improved Combinatorial Algorithms for the Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.378, October 17-18, 1999
4. Kenneth L. Clarkson, A randomized algorithm for closest-point queries, SIAM Journal on Computing, v.17 n.4, p.830-847, August 1988 [doi〉10.1137/ 0217052]
5. Edith Cohen , David D. Lewis, Approximating matrix multiplication for pattern recognition tasks, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.682-691, January 05-07, 1997, New Orleans, Louisiana, United States
6. Fabián A. Chudak, Improved Approximation Algorithms for Uncapitated Facility Location, Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.180-194, June 22-24, 1998
7. Fabián A. Chudak , David B. Shmoys, Improved approximation algorithms for a capacitated facility location problem, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.875-876, January 17-19, 1999, Baltimore, Maryland, United States
8. D. Eppstein, "Dynamic Euclidean minimum spanning trees and extrema of binary functions", Disc. Comp. Geom. 13, pp. 111-122, 1995.
9. D. Eppstein, personal communication, 1999.
10. Ömer E>ilde;ecio>ilde;lu , Bahman Kalantari, Approximating the diameter of a set of points in the Euclidean space, Information Processing Letters, v.32 n.4, p.205-211, Sept 1, 1989 [doi〉10.1016/0020-0190(89)90045- 8]
11. S. Even, O. Kariv, "An O(n 2"5) algorithm for maximum matching in general graphs", FOCS'75, pp. 100- 112.
12. Daniele V. Finocchiaro , Marco Pellegrini, On Computing the Diameter of a Point Set in High Dimensional Euclidean Space, Proceedings of the 7th Annual European Symposium on Algorithms, p.365-377, July 16-18, 1999
13. H. Gabow, R. Tarjan, "Faster scaling algorithms for general graph matching problems".
14. Michel X. Goemans , David P. Williamson, The primal-dual method for approximation algorithms and its application to network design problems, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
15. M. Grotschel, L. Lovasz, and A. Schrijver, "Geometric algorithms and combinatorial optimization", Springer- Verlag, 1987.
16. Sudipto Guha , Samir Khuller, Greedy strikes back: improved facility location algorithms, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.649-657, January 25-27, 1998, San Francisco, California, United States
17. P. Indyk, On Approximate Nearest Neighbors in Non-Euclidean Spaces, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.148, November 08-11, 1998
18. Piotr Indyk, Dimensionality reduction techniques for proximity problems, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.371-378, January 09-11, 2000, San Francisco, California, United States
19. Piotr Indyk , Rajeev Motwani, Approximate nearest neighbors: towards removing the curse of dimensionality, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.604-613, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276876]
20. Piotr Indyk , Rajeev Motwani, High-dimensional computational geometry, 2001
21. Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan , Santosh Vempala, Localitypreserving hashing in multidimensional spaces, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.618-625, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258656]
22. W.B. Johnson and J. Lindenstrauss, "Extensions of Lipshitz mapping into Hilbert space", Contemporary Mathematics, 26(1984), pp. 189-206.
23. Kamal Jain , Vijay V. Vazirani, Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.2, October 17-18, 1999
24. Jon M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.599-608, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258653]
25. Eyal Kushilevitz , Rafail Ostrovsky , Yuval Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.614-623, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276877]
26. S. Meiser, Point location in arrangements of hyperplanes, Information and Computation, v.106 n.2, p.286-303, Oct. 1993 [doi〉10.1006/inco.1993.1057]
27. K. Mulmuley, "Computational geometry", Prentice Hall, 1993.
28. Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
29. Jon Louis Bentley , Michael Ian Shamos, Divide-and-conquer in multidimensional space, Proceedings of the eighth annual ACM symposium on Theory of computing, p.220-230, May 03-05, 1976, Hershey, Pennsylvania, United States [doi〉10.1145/800113.803652]
30. David B. Shmoys , Éva Tardos , Karen Aardal, Approximation algorithms for facility location problems (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.265-274, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/258533.258600]
31. Peter N. Yianilos, Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract), Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.361-370, January 09-11, 2000, San Francisco, California, United States