The classical Steiner problem is the problem of nding the shortest graph connecting a given finite set of points. In this seminar we review the classical problem and introduce a new, generalized formulation, which extends the original one to infinite sets in metric spaces.
@article{3421,
title = {Minimal connections: the classical Steiner problem and generalizations},
journal = {Bruno Pini Mathematical Analysis Seminar},
year = {2012},
doi = {10.6092/issn.2240-2829/3421},
language = {EN},
url = {http://dml.mathdoc.fr/item/3421}
}
Paolini, Emanuele. Minimal connections: the classical Steiner problem and generalizations. Bruno Pini Mathematical Analysis Seminar, (2012), . doi : 10.6092/issn.2240-2829/3421. http://gdmltest.u-ga.fr/item/3421/