Graham’s problem on shortest networks for points on a circle. (English) Zbl 0748.05051

Given a finite set of points \(x_ 1,x_ 2,\dots,x_ n\) in the Euclidean plane. The problem of finding a network of smallest total length which connects up the points is called the Steiner problem and a solution is a Steiner tree or a Steiner minimum tree. When the points are located on a circle of radius \(r\) with \(x_ i\) adjacent to \(x_{i+1}\), \(1\leq i\leq n-1\) and at most one edge \(x_ ix_{i+1}\) and \(x_ nx_ 1\) has length greater than \(r\), the authors prove that a Steiner tree consists of all edges \(x_ ix_{i+1}\) plus \(x_ nx_ 1\), \(1\leq i\leq n-1\) with the longest edge removed.


05C12 Distance in graphs
05C05 Trees
Full Text: DOI


[1] Du, D. Z.; Hwang, F. K.; Chao, S. C., Steiner Minimal Tree for Points on a Circle, Proc. Amer. Math. Soc., 95, 613-618 (1985) · Zbl 0596.05022 · doi:10.2307/2045853
[2] Garey, M. R.; Graham, R. L.; Johnson, D. S., The Complexity of Computing Steiner Minimal Trees, SIAM J. Appl. Math., 32, 835-859 (1977) · Zbl 0399.05023 · doi:10.1137/0132072
[3] Gilbert, E. N.; Pollak, H. O., Steiner Minimal Trees, SIAM J. Appl. Math., 16, 1-29 (1968) · Zbl 0159.22001 · doi:10.1137/0116001
[4] R. L. Graham, Some Results on Steiner Minimal Trees, Unpublished manuscript dated 11 May 1967.
[5] Melzak, Z. A., On the Problem of Steiner, Canad. Math. Bull, 4, 143-148 (1961) · Zbl 0101.13201
[6] Pollak, H. O., Some Remarks on the Steiner Problem, J. Combin. Theory Ser. A, 24, 278-295 (1978) · Zbl 0392.05021 · doi:10.1016/0097-3165(78)90058-4
[7] J. H. Rubinstein and D. A. Thomas, A Variational Approach to the Steiner Network Problem, Preprint. · Zbl 0734.05040
[8] J. H. Rubinstein and D. A. Thomas, Critical Points for the Steiner Ratio Conjecture, Preprint. · Zbl 0739.05034
[9] J. H. Rubinstein and D. A. Thomas, The Steiner Ratio Conjecture for Cocircular Points, Preprint. · Zbl 0774.05031
[10] J. H. Rubinstein and D. A. Thomas, The Steiner Ratio Conjecture for Six Points, Preprint. · Zbl 0739.05034
[11] J. H. Rubinstein, D. A. Thomas, and J. F. Weng, Degree Five Steiner Points Cannot Reduce Network Costs for Planar Sets, Preprint. · Zbl 0774.05032
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.