Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
From MaRDI portal
Publication:847398
DOI10.1016/j.aml.2008.01.004zbMath1193.05071OpenAlexW2145549603MaRDI QIDQ847398
Vincent L. Moulton, Katharina T. Huber, Andreas W. M. Dress, Jack H. Koolen
Publication date: 12 February 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2008.01.004
Metric spaces, metrizability (54E35) Distance in graphs (05C12) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85)
Related Items (3)
Block realizations of finite metrics and the tight-span construction. I: The embedding theorem ⋮ Optimal realizations and the block decomposition of a finite metric space ⋮ An algorithm for computing cutpoints in finite metric spaces
Cites Work
- Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
- Cut points in metric spaces
- Compatible decompositions and block realizations of finite metrics
- A graph-theoretical invariant of topological spaces
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- A canonical decomposition theory for metrics on a finite set
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform
- \(T\)-theory: An overview
- Six theorems about injective metric spaces
- An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces
This page was built for publication: Block realizations of finite metrics and the tight-span construction. I: The embedding theorem