Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space. II: The gradient-constraint m satisfies 1 m 3

DOI10.1002/NET.20406MaRDI QIDQ3087623zbMATH OpenOpenAlexWikidataFDO

Authors Kevin H. Prendergast, Jia Weng, D. A. 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

gradient-constrained networkslocally minimalminimum networksSteiner trees

Mathematics Subject Classification ID

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

Recommendations

• Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
• Gradient-constrained minimum networks. I: Fundamentals.
• Gradient-constrained minimum networks. III: Fixed topology
• Computing Steiner points for gradient-constrained minimum networks
• scientific article; zbMATH DE number 1163706

Cites work

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

Cited in

(3)

• Gradient-constrained minimum networks. III: Fixed topology
• 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. II: The gradient-constraint \(m\) satisfies \(1 \leq m \leq \sqrt{3}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087623)