Computing Steiner points for gradient-constrained minimum networks

DOI10.1016/J.DISOPT.2009.10.001zbMath1264.05134DBLPjournals/disopt/ThomasW10OpenAlexW1964421131WikidataQ61714619 ScholiaQ61714619MaRDI QIDQ1952503

Doreen Anne Thomas, Jia Feng Weng

Publication date: 31 May 2013

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.10.001

zbMATH Keywords

Steiner treeunderground mininggradient constrained

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

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}

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variational approach to the Steiner network problem
• Locally minimal uniformly oriented shortest networks
• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• The Steiner tree problem
• Minimum networks for four points in space
• On the Problem of Steiner
• Network optimization for the design of underground mines
• The transitive groups of degree up to eleven⁺
• Minimum cost flow‐dependent communication networks
• Gradient-constrained minimum networks. I: Fundamentals.

This page was built for publication: Computing Steiner points for gradient-constrained minimum networks