Abstract
The Steiner problem is considered in the Gromov-Hausdorff space, i.e., in the space of compact metric spaces (considered up to isometry) endowed with the Gromov-Hausdorff distance. Since this space is not boundedly compact, the problem of the existence of a shortest network in this space is open. It is shown that each finite family of finite metric spaces can be connected by a shortest network. Moreover, it turns out that in this case there exists a shortest tree all of whose vertices are finite metric spaces. An estimate for the number of points in these metric spaces is obtained. As an example, the case of three-point metric spaces is considered. It is also shown that the Gromov-Hausdorff space does not realize minimal fillings; i.e., shortest trees in this space need not be minimal fillings of their boundaries.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
