Degree-five Steiner points cannot reduce network costs for planar sets. (English) Zbl 0774.05032

Answering a question due to W. M. Boyce the authors show that a degree- five Steiner point can never appear in a least-cost planar network.


05C05 Trees
Full Text: DOI


[1] Can degree five Steiner points reduce network costs for planar sets. Preprint (1970).
[2] Cockayne, SIAM J. Appl. Math. 18 pp 150– (1970)
[3] Cockayne, Info. Process. Lett. 22 pp 151– (1986)
[4] Cockayne, Math. Mag. 42 pp 206– (1969)
[5] Smith, Networks 11 pp 23– (1981)
[6] Rubinstein, Ann. of Operations Res. 33 pp 481– (1991)
[7] Winter, Networks 15 pp 323– (1985)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.