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 / Emanuele Paolini. - In: BRUNO PINI MATHEMATICAL ANALYSIS SEMINAR. - ISSN 2240-2829. - ELETTRONICO. - 3:(2012), pp. 72-87.
Minimal connections: the classical Steiner problem and generalizations
PAOLINI, EMANUELE
2012
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:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Paolini2012.pdf
accesso aperto
Tipologia:
Altro
Licenza:
Tutti i diritti riservati
Dimensione
278.74 kB
Formato
Adobe PDF
|
278.74 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
