Efficient parallel algorithms for geometric k-clustering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 775 LNCS, Issue , 1994, Pages 475-486

  Datta, Amitava ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; PARALLEL ALGORITHMS;

CLUSTERING PROBLEMS; K POINTS; PARALLEL COMPUTATION; POINT SET; PRAM MODELS; SEQUENTIAL ALGORITHM; TIME COMPLEXITY; TWO-DIMENSION;

CLUSTERING ALGORITHMS;

EID: 84904308355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57785-8_164     Document Type: Conference Paper

References (14)

1. H. C. Andrews. Introduction to Mathematical Techniques in Pattern Recognition. Wiley-Interscience, New York, 1972.
2. A. Aggarwal, H. Imai, N. Katoh and S. Suri. Finding k points with minimum diameter and related problems. J. Algorithms 12 (1991), pp. 38-56.
3. O. Berkman, D. Breslauer, Z. Galil, B. Scheiber and U. Vishkin. Highly parallelizable problems, Proc. 21st Annual ACM Symp. on Theory of Computing, 1989, pp. 309-319.
4. S. Chandran, S. K. Kim and D. M. Mount. Parallel computational geometry of rectangles. Algorithmica, 7, (1992), pp. 25-49.
5. R. Cole. Parallel merge sort. SIAM J. Comput. 17, (1988), pp. 770-785.
6. A. Datta, H. P. Lenhof, C. Schwarz and M. Smid. Static and dynamic algorithms for k-point clustering problems. Proceedings of WADS ‘93, Lecture Notes in Computer Science, Springer-Verlag, Vol. 709, pp. 265-276.
7. D. Eppstein and J. Erickson. Iterated nearest neighbours and finding minimal polytopes. Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, (1993), pp. 64-73.
8. G. N. Prederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences, 24, (1982), pp. 197-208.
9. J. A. Hartigan. Clustering Algorithms, John-Wiley, New York, 1975.
10. J. JáJá. An introduction to Parallel Algorithms. Addison-Wesley, 1992.
11. 2 + + X m. SIAM J. Comput. 7, (1978), pp. 147-157.
12. H. P. Lenhof and M. Smid. Sequential and parallel algorithms for the k-closest pairs problem. Max Planck Institut für Informatik, Technical Report, MPI-I-92-134, August 1992. A preliminary version appears in Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 380-386.
13. F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985.
14. R. Sarnath and X. He. Efficient parallel algorithms for selection and searching on sorted matrices. Proc. 6th International Parallel Processing Symposium, (1992), pp. 108-111.