Minimum networks for four points in space

DOI10.1023/A:1020389712969zbMath1009.05042OpenAlexW179792009MaRDI QIDQ1851073

Yanyan Li

Publication date: 15 December 2002

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020389712969

zbMATH Keywords

Steiner treeminimum network

Mathematics Subject Classification ID

Trees (05C05) Numerical optimization and variational techniques (65K10)

Related Items (9)

Upper and lower bounds for the lengths of Steiner trees in 3-space ⋮ Approximate Euclidean Steiner trees ⋮ Gradient-constrained minimum networks. III: Fixed topology ⋮ Computing Steiner points for gradient-constrained minimum networks ⋮ Euclidean Steiner trees optimal with respect to swapping 4-point subtrees ⋮ COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES ⋮ An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space ⋮ Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points ⋮ IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE

This page was built for publication: Minimum networks for four points in space