The last achievements in Steiner tree approximations
Year: 1993
Type: article
Abstract: 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.
Author: Alex Zelikovsky
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W184334334
