The last achievements in Steiner tree approximations
Alex Zelikovsky · 1993
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.