Selection in Monotone Matrices and Computing kth Nearest Neighbors

Journal of Algorithms

Volumn 20, Issue 3, 1996, Pages 581-601

  Agarwal, Pankaj K ^a   Sen, Sandeep ^b  

^a Duke University   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MATRIX; NEAREST NEIGHBOUR; SELECTION PROBLEM; TIME COMPLEXITY;

ALGORITHMS;

EID: 0030356054     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0028     Document Type: Article

References (40)

1. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane, Algorithmica 9 (1993), 495-514.
2. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput. 22 (1993), 794-806.
3. P. K. Agarwal and J. Matoušek, Range searching with semi-algebraic sets, Discrete Comput. Geom. 11 (1994), 393-418.
4. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987), 195-208.
5. A. Aggarwal and J. Park, Parallel searching in multidimensional monotone arrays, J. Algorithms, to appear.
6. A. Aggarwal and J. Park, Sequential searching in multidimensional monotone arrays, J. Algorithms, to appear.
7. A. Aggarwal and J. Park, Improved algorithms for economic lot size problems, Oper. Res. 41 (1993), 549-571.
8. A. Aggarwal, D. Kravets, J. Park, and S. Sen, Parallel searching in generalized Monge arrays with applications, in "Proc. 2nd ACM Symp. Parallel Algorithms and Architectures, 1990," pp. 259-268.
9. A. Aggarwal and S. Suri, Computing the longest diagonal of a simple polygon, Inform. Process. Lett. 35 (1990), 13-18.
10. N. Alon and Y. Azar, Comparison-sorting and selecting in totally monotone matrices, in "Proceedings 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992," pp. 403-408.
11. R. Bar Yehuda and S. Fogel, Good splitters with applications to ray shooting, Algorithmica 11 (1994), 133-145.
12. M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan, Time bounds for selection, J. Comput. Systems Sci. 7 (1973), 448-461.
13. P. Callahan and S. Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, in "Proceedings, 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993," pp. 291-300.
14. B. Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom. 10 (1993), 145-158.
15. B. Chazelle, R. Cole, F. Preparata, and C. Yap, New upper bounds for neighbor searching. Inform and Control 68 (1986), 105-124.
16. B. Chazelle, M. Sharir, and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Algorithmica 8 (1992), 407-429.
17. B. Chazelle and E. Welzl, Quasi-optimal range searching in space of finite VC-dimension. Discrete Comput. Geom. 4 (1989), 467-490.
18. M. Dickerson, R. Drysdale, and J. Sack, Simple algorithms for enumerating interpoint distances and finding k nearest neighbors, Internat. J. Comput. Geom. Appl. 2 (1992), 221-239.
19. E. Dijkstra, "A Discipline of Programming," Prentice-Hall, Englewood Cliffs, NJ, 1976.
20. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, Berlin, 1987.
21. P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.
22. D. Eppstein, Sequence comparison with mixed convex and concave sets, J. Algorithms 11 (1990), 85-101.
23. G. Frederickson and D. Johnson, Finding the kth shortest paths and p-centers by generating and searching good data structures, J. Algorithms 4 (1983), 61-80.
24. G. Frederickson and D. Johnson, Generalized selection and ranking: sorted matrices, SIAM J. Comput. 13 (1984), 14-30.
25. Z. Galil and J. Park, A linear-time algorithm for concave one-dimensional dynamic programming, Inform. Process. Lett. 33 (1990), 309-311.
26. L. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. Comput. Systems Sci. 39 (1989), 126-152.
27. J. Hershberger and S. Suri, Matrix searching with the shortest path metric, in "Proceedings 25th Annual ACM Symposium on Theory of Computing, 1992," pp. 485-494.
28. m, SIAM J. Comput. 7 (1978), 147-153.
29. M. Klawe and D. Kleitman, An almost linear time algorithm for generalized matrix searching, SIAM J. Discrete Math. 3 (1990), 81-97.
30. D. Kravets and J. Park, Selection and sorting in totally monotone arrays, Math. Systems Theory 24 (1991), 201-220.
31. Y. Mansour, J. Park, B. Schieber, and S. Sen, Improved selection in totally monotone arrays, Internat. J. Comput. Geom. Appl. 3 (1993), 115-132.
32. L. Larmore and B. Schieber, On line dynamic programming with applications to the prediction of RNA secondary structures, J. Algorithms 12 (1992), 490-515.
33. J. Matoušek and E. Welzl, Good splitters for counting points in triangles, J. Algorithms 13 (1992), 307-319.
34. N. Megiddo, Combinatorial optimization with rational objective functions, Math. Oper. Res. 4, (1979), 414-424.
35. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
36. N. Sarnak and R. E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986), 609-679.
37. A. Schönhage, M. Paterson, and N. Pipinger, Finding the median, J. Comput. Systems Sci. 13 (1976), 184-199.
38. R. Wilber, The concave least-weight subsequence problem revisited, J. Algorithms 9 (1988), 418-425.
39. X. Wu, Optimal quantization by matrix searching, J. Algorithms 12 (1991), 663-673.
40. P. Vaidya, An O(n log n) algorithm for the all-nearest-neighbors problem, Discrete Comput. Geom. 4 (1989), 101-115.