In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.
[1]
Ronald L. Graham,et al.
On the History of the Minimum Spanning Tree Problem
,
1985,
Annals of the History of Computing.
[2]
F. Hwang,et al.
The Steiner Tree Problem
,
2012
.
[3]
Chaitanya Swamy,et al.
Network design for information networks
,
2005,
SODA '05.
[4]
Weiping Shi,et al.
The rectilinear Steiner arborescence problem is NP-complete
,
2000,
SODA '00.
[5]
Xiaohua Jia,et al.
A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem
,
2002,
J. Glob. Optim..