Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}

DOI10.1002/net.20406zbMath1221.90031OpenAlexW2067239519WikidataQ61714617 ScholiaQ61714617MaRDI QIDQ3087623

Jia Weng, Kevin H. Prendergast, Doreen Anne Thomas

Publication date: 16 August 2011

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

Steiner treeslocally minimalminimum networksgradient-constrained networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Cites Work

• A variational approach to the Steiner network problem
• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• The Steiner tree problem
• Computing Steiner points for gradient-constrained minimum networks
• Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
• Gradient-constrained minimum networks. I: Fundamentals.

This page was built for publication: Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}