Published Paper
AI statement: 🟢 AI-Free: no AI used.

Inserted: 20 sep 2013
Last Updated: 9 nov 2026

Journal: Bruno Pini Mathematical Analysis Seminar
Volume: 3
Number: 1
Pages: 72
Year: 2012
Links: original publication (free access), download PDF

Abstract:

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.

Keywords: Steiner problem, minimal connection