Name
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. |
Year | Venue | Keywords |
|---|---|---|
1993 | The Computer Science Journal of Moldova | steiner tree,metric space,steiner tree problem,time complexity |
Field | DocType | Volume |
Discrete mathematics,Mathematical optimization,Combinatorics,Range tree,Steiner tree problem,k-minimum spanning tree,Vantage-point tree,K-ary tree,Spanning tree,Shortest-path tree,Mathematics,Minimum spanning tree | Journal | 1 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
10 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Zelikovsky | 1 | 289 | 38.30 |