Computing Steiner points for gradient-constrained minimum networks

DOI10.1016/J.DISOPT.2009.10.001zbMATH Open1264.05134DBLPjournals/disopt/ThomasW10OpenAlexW1964421131WikidataQ61714619 ScholiaQ61714619MaRDI QIDQ1952503FDOQ1952503

Authors: D. A. Thomas, J. F. 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

Recommendations

• scientific article; zbMATH DE number 1163706
• The Steiner minimal network for convex configurations
• Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
• scientific article; zbMATH DE number 709122
• On length-minimizing Steiner networks
• On globally minimal Steiner networks with convex boundary points on the plane
• A rectilinear steiner minimal tree algorithm for convex point sets
• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• Approximations for Steiner trees with minimum number of Steiner points

zbMATH Keywords

Steiner treeunderground mininggradient constrained

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Gradient-constrained discounted Steiner trees. I: Optimal tree configurations
• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• On globally minimal Steiner networks with convex boundary points on the plane
• Gradient-constrained minimum networks. I: Fundamentals.
• Minimal curvature-constrained networks
• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
• Curvature-constrained Steiner networks with three terminals
• Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
• Gradient-constrained minimum networks. III: Fixed topology
• Exactly solvable and unsolvable shortest network problems in 3D-space
• 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}\)

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

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