A survey of parallel and distributed algorithms for the steiner tree problem
M Bezenšek, B Robič - International Journal of Parallel Programming, 2014 - Springer
Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree
that connects the input points, where it is possible to add new points to minimize the length …
that connects the input points, where it is possible to add new points to minimize the length …
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs
In this paper, we present a parallel 2-approximation Steiner minimal tree algorithm and its
MPI-based distributed implementation. In place of expensive distance computations …
MPI-based distributed implementation. In place of expensive distance computations …
Towards distributed 2-approximation Steiner minimal trees in billion-edge graphs
Given an edge-weighted graph and a set of known seed vertices of interest, a network
scientist often desires to understand the graph relationships to explain connections between …
scientist often desires to understand the graph relationships to explain connections between …