Graham's problem on shortest networks for points on a circle
- 83 Downloads
Suppose a configurationX consists ofn points lying on a circle of radiusr. If at most one of the edges joining neighboring points has length strictly greater thanr, then the Steiner treeS consists of all these edges with a longest edge removed. In order to showS is, in fact, just the minimal spanning treeT, a variational approach is used to show the Steiner ratio for this configuration is at least one and equals one only ifS andT coincide. The variational approach greatly reduces the number of possible Steiner trees that need to be considered.
Key wordsGraham's conjecture Steiner trees Spanning trees Variational approach Cocircular points
Unable to display preview. Download preview PDF.
- R. L. Graham, Some Results on Steiner Minimal Trees, Unpublished manuscript dated 11 May 1967.Google Scholar
- J. H. Rubinstein and D. A. Thomas, A Variational Approach to the Steiner Network Problem, Preprint.Google Scholar
- J. H. Rubinstein and D. A. Thomas, Critical Points for the Steiner Ratio Conjecture, Preprint.Google Scholar
- J. H. Rubinstein and D. A. Thomas, The Steiner Ratio Conjecture for Cocircular Points, Preprint.Google Scholar
- J. H. Rubinstein and D. A. Thomas, The Steiner Ratio Conjecture for Six Points, Preprint.Google Scholar
- J. H. Rubinstein, D. A. Thomas, and J. F. Weng, Degree Five Steiner Points Cannot Reduce Network Costs for Planar Sets, Preprint.Google Scholar