The last achievements in Steiner tree approximations
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1993-02-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n1/v1-n1-(pp35-44).pdf |