Sets admitting connection by graphs of finite length

DOI10.1070/SM2005v196n06ABEH000903zbMath1081.54024OpenAlexW2131290686MaRDI QIDQ5713319

I. M. Nikonov, A. A. Tuzhilin, Alexandr O. Ivanov

Publication date: 14 December 2005

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm2005v196n06abeh000903

zbMATH Keywords

minimal spanning treeSteiner ratiogeneralized Steiner problemgood setconnected graph of finite length

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Metric spaces, metrizability (54E35) Geometry and structure of normed linear spaces (46B20) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (5)

Special metric invariants ⋮ Unnamed Item ⋮ Minimal spanning trees on infinite sets ⋮ Minimal Networks: A Review ⋮ Outer linear measure of connected sets via Steiner trees

This page was built for publication: Sets admitting connection by graphs of finite length