Degree-five Steiner points cannot reduce network costs for planar sets

DOI10.1002/net.3230220604zbMath0774.05032OpenAlexW2074330433MaRDI QIDQ4021820

Joachim Hyam Rubinstein, Doreen Anne Thomas, Jia Feng Weng

Publication date: 17 January 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220604

zbMATH Keywords

Steiner problemleast-cost planar network

Mathematics Subject Classification ID

Trees (05C05)

Related Items (5)

Directional derivative of the weight of a minimal filling in Riemannian manifolds ⋮ Graham's problem on shortest networks for points on a circle ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ On the restricted 1-Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem

This page was built for publication: Degree-five Steiner points cannot reduce network costs for planar sets