Minimal connections: the classical Steiner problem and generalizations

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 connections