AbstractIt was conjectured by Gilbert and Pollak [6] that, for any finite set of points in the Euclidean plane, the ratio of the length of a Steiner minimal tree to the length of a minimal spanning tree is at least
% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaOaaaeaaca% aIZaaaleqaaOGaai4laiaaikdaaaa!383E!
$$\sqrt 3 /2$$
. To date, this has been proved only for at most five points. In this paper, some analytic formulas for the length of full Steiner trees are considered. These provide an alternative proof of the conjecture for quadrilaterals, and the foundation for a possible approach for more complicated polygons.
[1]
Ronald L. Graham,et al.
A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES
,
1985
.
[2]
Ding-Zhu Du,et al.
A new bound for the steiner ratio
,
1983
.
[3]
Ding-Zhu Du,et al.
Steiner minimal trees on zig-zag lines
,
1983
.
[4]
Henry O. Pollak,et al.
Some Remarks on the Steiner Problem
,
1978,
J. Comb. Theory A.
[5]
F. K. Hwang,et al.
The Steiner Ratio Conjecture Is True for Five Points
,
1985,
J. Comb. Theory A.
[6]
Ding-Zhu Du,et al.
A Short Proof of a Result of Pollak on Steiner Minimal Trees
,
1982,
J. Comb. Theory, Ser. A.
[7]
Z. A. Melzak.
On the Problem of Steiner
,
1961,
Canadian Mathematical Bulletin.
[8]
H. Pollak,et al.
Steiner Minimal Trees
,
1968
.