A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Steiner ratio of several discrete metric spaces

2003
*
Discrete Mathematics
*

Steiner's Problem is the "Problem of shortest connectivity", that means, given a ÿnite set of points in a metric space (X; ), search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices di erent from the points which are to be connected. Such points are called Steiner points. If we do not allow Steiner points, that means, we only connect certain pairs of the given points, we get a

doi:10.1016/s0012-365x(02)00762-8
fatcat:2tmfstv3pvewlonbpysvuznshy