Minimal connections: the classical Steiner problem and generalizations
The classical Steiner problem is the problem of finding 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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Bologna
2012-12-01
|
Series: | Bruno Pini Mathematical Analysis Seminar |
Subjects: | |
Online Access: | http://mathematicalanalysis.unibo.it/article/view/3421 |
Summary: | The classical Steiner problem is the problem of finding 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. |
---|---|
ISSN: | 2240-2829 |