IMCS/Publications/CSJM/Issues/CSJM v.1, n.1 (1), 1993/

The last achievements in Steiner tree approximations

Authors: A. Zelikovsky


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.

A.Z. Zelikovsky
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str.,
Chisinau, 277028, Moldova


Adobe PDF document0.13 Mb