Nonstandard \(n\)-distances based on certain geometric constructions

DOI10.1007/s13366-022-00623-5OpenAlexW3205355075MaRDI QIDQ2689456

Jean-Luc Marichal, Gergely Kiss

Publication date: 10 March 2023

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

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

zbMATH Keywords

metric geometrysmallest enclosing ballChebyshev ballEuclidean minimal spanning treesimplex inequality\(n\)-distanceEuclidean Steiner tree

Mathematics Subject Classification ID

General theory of distance geometry (51K05) Systems of functional equations and inequalities (39B72)

Cites Work

• Unnamed Item
• Geometric methods and optimization problems
• Steiner minimal trees
• A generalization of the concept of distance based on the simplex inequality
• Shortest connectivity. An introduction with applications in phylogeny.
• On the best constants associated with \(n\)-distances
• On the history of the Euclidean Steiner tree problem
• Spanning Trees and Optimization Problems
• Encyclopedia of Distances

This page was built for publication: Nonstandard \(n\)-distances based on certain geometric constructions