scientific article; zbMATH DE number 1163706

MaRDI QIDQ4395319zbMATH OpenFDO

Authors M. Brazil, D. A. Thomas, J. F. Weng

Publication date 5 July 1999

zbMATH Keywords

gradient-constrained Steiner problemminimal Steiner treesshortest network

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Gradient-constrained minimum networks. III: Fixed topology
• Gradient-constrained minimum networks. I: Fundamentals.
• Computing Steiner points for gradient-constrained minimum networks
• scientific article; zbMATH DE number 1339503

Cited in

(11)

• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• Non-crossing of plane minimal spanning and minimal T1 networks
• Exactly solvable and unsolvable shortest network problems in 3D-space
• Gradient-constrained minimum networks. III: Fixed topology
• Computing Steiner points for gradient-constrained minimum networks
• 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}\)
• Shortest Networks for Smooth Curves
• Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
• scientific article; zbMATH DE number 6469181 (Why is no real title available?)
• Gradient-constrained minimum networks. I: Fundamentals.
• Minimum gradation in greyscales of graphs

This page was built for publication:

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