An overview of maximal distance minimizers problem

Publication date 11 December 2022

Abstract: Consider a compact

M s u b s e t m a t h b b R^{d}

and

l > 0

. A maximal distance minimizer problem is to find a connected compact set

S i g m a

of the length (one-dimensional Hausdorff measure

H

) at most

l

that minimizes [ max_{y in M} dist (y, Sigma), ] where

d i s t

stands for the Euclidean distance. We give a survey on the results on the maximal distance minimizers and related problems.

This page was built for publication: An overview of maximal distance minimizers problem