, weight
and length
for each
, positive integer
B
.
for
G
such that the sum of the weights
of the edges in
E'
does not exceed
B
.
for any
[
296
].
for planar graphs.
Not approximable within 5/4
if
l(e)=1
for every edge
e
[
296
].
For results on minimum Steiner trees of bounded diameter, see M
INIMUM
S
TEINER
T
REE
.
Viggo Kann