Abstract
This paper presented a parallel local search algorithm for the Steiner tree problem. The main contribution of this work is the o(n^2 \log^2 n+\log n(\frac{n}{{\log n}})) parallel local search algorithm for computing Steiner tree on the Euclidean plane. The algorithmused proximity structures from computational geometry like, Voronoi diagram, Delaunay triangulation, Gabriel graph, and relative neighborhood graphs to compute additional or Steiner points.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
