No label defined (Q3689203)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3912403
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3912403

      Statements

      1985
      0 references
      Steiner minimal trees
      0 references
      minimum spanning tree
      0 references
      0 references
      0 references
      [For the entire collection see Zbl 0564.00011.] Let X be a finite set of points in the Euclidean plane, \(L_ M(X)\) denote the sum of the lengths of the line segments in a minimum spanning tree M(X) for X and \(L_ S(X)\) denote the sum of the lengths of the line segments in the Steiner minimal trees for X. (A Steiner minimal tree S(X) for X is a minimum spanning tree M(Y) having the least possible length over all sets \(Y\supseteq X)\). The expression \(\rho =\inf_ X(L_ S(X)/L_ M(X))\) is a measure of how well M(X) approximates S(X) in length. Gilbert and Pollak conjectured \(\rho =\sqrt{3}/2=0,866025...,\) which, if true, would be best possible, as the example of an equilateral triangle shows. Lower bounds for \(\rho\) have been improved during the past years, and the authors prove the following new bound: \(\rho \geq \rho_ 0=0,82416874...\), where \(\rho_ 0\) is a specified root of an explicitly stated polynomial of degree 12.
      0 references

      Identifiers