The Steiner tree problem requires a shortest tree spanning a given point set S contained in a metric space (V,d). We describe a new approach to approximation solutions of this problem and analyze the time complexity of several algorithms.
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str.,
Chisinau, 277028, Moldova
– 0.13 Mb