Parallel Greedy Adaptive Search Algorithm for Steiner Tree Problem

In this paper, a parallel algorithm for the Steiner tree problem is presented. The algorithm is based on the well-known multi-start paradigm the GRASP and the well-known proximity structures from computational geometry. The main contribution of this paper is the O(n log n+log n log( n log n )) parallel algorithm for computing Steiner tree on the Euclidean plane. The parallel algorithm used proximity structures from computation geometry like, Voronoi diagram, Delaunay triangulation, Gabriel graph, and relative neighborhood graphs to compute additional or Steiner