Speaker
Yana Teplitskaya
(Université Paris-Saclay)
Description
The Steiner tree problem is a problem of connecting a given compact set by a shortest way. By a full Steiner tree we name a solution of the Steiner tree problem without vertices of degree 2.
I will talk about two solutions to the Steiner problem with given data differ by only one vertex. Every solution for the first data appears to be a full Steiner tree with an infinite number of branching points (id est points of degree 3) and every solution for the second data is a union of full Steiner trees on five vertices.
