A new bound for the steiner ratio

Let V denote a given set of n points in the euclidean plane. A Steiner minimal tree for V is the shortest network (clearly, it has to be a tree) interconnecting V. Junctions of the network which are not in V are called Steiner points (those in V will be called regular points). A shortest tree interconnecting V without using any Steiner points is called a minimal tree. Let a( V) and ,u( V) denote the lengths of a Steiner minimal tree and a minimal tree, respectively. Define p to be the greatest lower bound for the ratio a( V)/1,( V) over all V. We prove p > .8.