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.
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
1993-02-01
|
| Serie: | Computer Science Journal of Moldova |
| Accesso online: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n1/v1-n1-(pp35-44).pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|