Work

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.
Language: English
Open Access status: green
OpenAlex ID: W184334334
FWCI:
Cites: 18
Cited by:
Related to: 10