An O(n^2) time approximation algorithm for the minimum rectilinear Steiner tree is proposedThe approximation ratio of the algorithm is strictly less than 15The computing performances show the costs of the spanning trees produced by the algorithm are only 08% away from the optimal ones

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

A Practical Algorithm for the Minimum Rectilinear Steiner Tree

Citations

Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees

References

Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees

Related Papers (5)

Geometric interconnection and placement algorithms

Improved approximations for the Steiner tree problem

A neighborhood improvement algorithm for rectilinear Steiner trees

Two probabilistic results on rectilinear Steiner trees

Approaching the 5/4-Approximation for Rectilinear Steiner Trees