Abstract
There is a set of points V = v 1, v 2,…, v n on a Euclidean plane, and the cost of the links between any two points on the plane is Euclidean distance metric. The Steiner tree problem, as was originally proposed by Georg Steiner, is to connect all points in V by shortest possible connected graph. Unlike spanning tree, this graph may contain other points in the plane. These extra nodes are called Steiner nodes. The original points in V are called site nodes. Later different variations of this original Steiner tree problem was proposed. In this article, this original Steiner tree problem will be addressed as minimum Euclidean Steiner tree (MEStT) problem.
Sign-in/Register to access full text options 
Free) 
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 call
