A parrallel algorithm for partitioning a point set to minimize the maximum of diameters
| Author(s) : | Alsuwaiyel MH, |
| Publisher : | C S R E A PRESS |
| Publication Date : | 1998 |
| ISSN : | N/A |
| Abstract : | Given a set S of n points ist the plane, we consider the problem of partitioning S into two subsets such that the masimum of their diameters is minimized. We present a parallel algorithm to solve this problem that runs in time O(log n log log n) using the GREW PRAM model of computation with O(n(2)) processors., |