On the horseshoe conjecture for maximal distance minimizers

DOI10.1051/cocv/2017025zbMath1405.49031arXiv1511.01026OpenAlexW2963879146WikidataQ123125159 ScholiaQ123125159MaRDI QIDQ4646820

Danila Cherkashin, Yana Teplitskaya

Publication date: 21 December 2018

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

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

zbMATH Keywords

Steiner treelocally minimal networkmaximal distance minimizer

Mathematics Subject Classification ID

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

Related Items (1)

Regularity of maximum distance minimizers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal urban networks via mass transportation
• Existence and regularity results for the Steiner problem
• Foundations of quantization for probability distributions
• Asymptotic analysis of a class of optimal location problems
• On one-dimensional continua uniformly approximating planar sets
• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• The p-center location problem in an area
• Long-term planningversusshort-term planning in the asymptotical location problem
• Continua of Finite Linear Measure I

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