(definition)

**Definition:**
For a given variant of the *Steiner tree* problem, the maximum possible ratio of the length of a *minimum spanning tree* of a set of *terminals* to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).

*Note:
In graphs ρ = 2. In the Euclidean metric, ρ = 2/ √(3). In the rectilinear metric, ρ = 3/2.*

Author: JLG

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Joseph L. Ganley, "Steiner ratio", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/steinerratio.html