The Steiner Minimal Network for Convex Configurations.
J.H. Rubinstein; D.A. Thomas; T. Cole
Discrete & computational geometry (1993)
- Volume: 9, Issue: 3, page 323-334
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
topHow to cite
topRubinstein, J.H., Thomas, D.A., and Cole, T.. "The Steiner Minimal Network for Convex Configurations.." Discrete & computational geometry 9.3 (1993): 323-334. <http://eudml.org/doc/131250>.
@article{Rubinstein1993,
author = {Rubinstein, J.H., Thomas, D.A., Cole, T.},
journal = {Discrete & computational geometry},
keywords = {minimal spanning tree; Euclidean plane; Steiner problem; shortest network; convex configuration; Steiner tree},
number = {3},
pages = {323-334},
title = {The Steiner Minimal Network for Convex Configurations.},
url = {http://eudml.org/doc/131250},
volume = {9},
year = {1993},
}
TY - JOUR
AU - Rubinstein, J.H.
AU - Thomas, D.A.
AU - Cole, T.
TI - The Steiner Minimal Network for Convex Configurations.
JO - Discrete & computational geometry
PY - 1993
VL - 9
IS - 3
SP - 323
EP - 334
KW - minimal spanning tree; Euclidean plane; Steiner problem; shortest network; convex configuration; Steiner tree
UR - http://eudml.org/doc/131250
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.