Geodesic
The Steiner Minimal Network for Convex Configurations.
Discrete & computational geometry, Tome 9 (1993) no. 2, pp. 323-334.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : minimal spanning tree, Euclidean plane, Steiner problem, shortest network, convex configuration, Steiner tree 
@article{DCG_1993__9_2_131250,
     author = {J.H. Rubinstein and D.A. Thomas and T. Cole},
     title = {The {Steiner} {Minimal} {Network} for {Convex} {Configurations.}},
     journal = {Discrete & computational geometry},
     pages = {323--334},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {1993},
     zbl = {0774.05033},
     url = {http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131250/}
}
TY  - JOUR
AU  - J.H. Rubinstein
AU  - D.A. Thomas
AU  - T. Cole
TI  - The Steiner Minimal Network for Convex Configurations.
JO  - Discrete & computational geometry
PY  - 1993
SP  - 323
EP  - 334
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131250/
ID  - DCG_1993__9_2_131250
ER  - 
%0 Journal Article
%A J.H. Rubinstein
%A D.A. Thomas
%A T. Cole
%T The Steiner Minimal Network for Convex Configurations.
%J Discrete & computational geometry
%D 1993
%P 323-334
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131250/
%F DCG_1993__9_2_131250
J.H. Rubinstein; D.A. Thomas; T. Cole. The Steiner Minimal Network for Convex Configurations.. Discrete & computational geometry, Tome 9 (1993) no. 2, pp. 323-334. http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131250/