Maximal distance minimizers an overview (part I) – Yana Teplitskaya (Paris-Saclay)


Sala seminari


Consider a compact M⊂R^d and L>0. A maximal distance minimizer problem is to find a connected compact set Σ of the length (one-dimensional Hausdorff measure H^1) at most L that minimizes max {dist(y,Σ): y∈M} where dist stands for the Euclidean distance. We give a survey on the results on the maximal distance minimizers and related problems.

Torna in cima