11 may 2011

**Abstract.**

Dipartimento di Matematica - Sala Seminari - ore 17:00

ABSTRACT: The Steiner problem is the problem of finding a minimal connected graph containing a given set of points. We will discuss the classical problem i.e. the case when the set of points is a finite subset of the plane. Then we will consider the generalized problem where we look for a connected set of minimal length containing any given compact set. The original results have been obtained in a joint work with Eugene Stepanov.