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.
Minimal connections: the classical Steiner problem and generalizations
PAOLINI, EMANUELE
2012-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
