Name
Abstract | ||
|---|---|---|
We give an up-to-date survey on the Euclidean Steiner problem which deals with the construction of a shortest network interconnecting a given set of points in the Euclidean plane. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF02061658 | Annals OR |
Field | DocType | Volume |
Discrete mathematics,Euclidean domain,Steiner tree problem,Euclidean distance,Smallest-circle problem,Euclidean minimum spanning tree,Euclidean geometry,Euclidean distance matrix,Mathematics,Euclidean shortest path | Journal | 33 |
Issue | Citations | PageRank |
1 | 4 | 0.50 |
References | Authors | |
23 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. K. Hwang | 1 | 332 | 100.54 |