On the horseshoe conjecture for maximal distance minimizers

DOI10.1051/COCV/2017025zbMATH Open1405.49031arXiv1511.01026OpenAlexW2963879146WikidataQ123125159 ScholiaQ123125159MaRDI QIDQ4646820FDOQ4646820

Authors: Danila Cherkashin, Yana Teplitskaya 

Publication date: 21 December 2018

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Abstract: We study the properties of sets $Sigma$ having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $Sigmasubsetmathbb{R}^2$ satisfying the inequality $mbox{max}_{yinM}mboxdist(y,Sigma)leqr$ for a given compact set $Msubsetmathbb{R}^2$ and some given $r>0$. Such sets can be considered shortest possible pipelines arriving at a distance at most $r$ to every point of $M$ which in this case is considered as the set of customers of the pipeline. We prove the conjecture of Miranda, Paolini and Stepanov about the set of minimizers for $M$ a circumference of radius $R>0$ for the case when $r<R/4.98$. Moreover we show that when $M$ is a boundary of a smooth convex set with minimal radius of curvature $R$, then every minimizer $Sigma$ has similar structure for $r<R/5$. Additionaly we prove a similar statement for local minimizers.

Full work available at URL: https://arxiv.org/abs/1511.01026

Recommendations

• Regularity of maximum distance minimizers
• On the extremal distance between two convex bodies
• A note on minimal horseshoe lemma
• Minimization of the Hausdorff distance between convex polyhedrons
• Minimax theorems with applications to convex metric spaces
• Extremal distance, hyperbolic distance, and convex hulls over domains with smooth boundary
• Minmax-distance approximation and separation problems: geometrical properties
• Measures of maximal dimension for linear horseshoes
• On the dimension of max-min convex sets
• scientific article; zbMATH DE number 1541645

zbMATH Keywords

Steiner treelocally minimal networkmaximal distance minimizer

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Optimization of shapes other than minimal surfaces (49Q10)

Cites Work

• Foundations of quantization for probability distributions
• The p-center location problem in an area
• Title not available (Why is that?)
• Optimal urban networks via mass transportation
• Existence and regularity results for the Steiner problem
• Title not available (Why is that?)
• Long-term planningversusshort-term planning in the asymptotical location problem
• Continua of Finite Linear Measure I
• Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
• On one-dimensional continua uniformly approximating planar sets
• Asymptotic analysis of a class of optimal location problems
• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• Title not available (Why is that?)

Cited In (1)

• Regularity of maximum distance minimizers

This page was built for publication: On the horseshoe conjecture for maximal distance minimizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646820)