On the Problem of Steiner

DOI10.4153/CMB-1961-016-2zbMath0101.13201MaRDI QIDQ3283373

Z. A. Melzak

Publication date: 1961

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

elementary geometry

Related Items

Exact computation of Steiner minimal trees in the plane, Symmetrization theorem of full Steiner trees, Hexagonal coordinate systems and Steiner minimal trees, Some results on greedy algorithm conjectures, The Gilbert and Pollak conjecture—a generalization, Steiner minimal trees for regular polygons, Computing the optimal bridge between two convex polygons, An algorithm for the steiner problem in the euclidean plane, Steiner minimal trees on sets of four points, Maximising the worth of nascent networks, Geometry-experiment algorithm for Steiner minimal tree problem, On the Steiner ratio in 3-space, The Steiner problem on a surface, A Steiner tree associated with three quarks, Full minimal Steiner trees on lattice sets, Cut and patch Steiner trees for ladders, An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach, GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM, Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R^d, Approximate Euclidean Steiner trees, Non-crossing of plane minimal spanning and minimal T1 networks, A delaunay triangulation‐based heuristic for the euclidean steiner problem, The exchange value embedded in a transport system, The Steiner tree problem in orientation metrics, Steiner's problem in graphs and its implications, Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³, Computation of Galois Group Elements of a Polynomial Equation, A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\), O(n log n)-average-time algorithm for shortest network under a given topology, Analytic deformations of minimal networks, Bifurcations of Steiner tree topologies in the plane, A New Bound for the Steiner Ratio, Problem reduction methods and a tree generation algorithm for the steiner network problem, Computing Steiner points for gradient-constrained minimum networks, Convexity and the Steiner tree problem, Steiner problem in networks: A survey, Minimal Networks: A Review, Geometry and topology of local minimal 2-trees, Steiner Minimal Trees on Zig-Zag Lines, Unnamed Item, Euclidean Steiner trees optimal with respect to swapping 4-point subtrees, Analytic formulas for full Steiner trees, Locating the vertices of a steiner tree in an arbitrary metric space, The Steiner ratio conjecture for six points, A primer of the Euclidean Steiner problem, The Steiner ratio for five points, Minimal length tree networks on the unit sphere, The role of Steiner hulls in the solution to Steiner tree problems, An O(N²) heuristic for steiner minimal trees in E³, On the structure and complexity of the 2-connected Steiner network problem in the plane, How to find Steiner minimal trees in Euclidean \(d\)-space, Graham's problem on shortest networks for points on a circle, Improved computation of plane Steiner minimal trees, Two new criteria for finding Steiner hulls in Steiner tree problems, Worst-case minimum rectilinear Steiner trees in all dimensions, A solvable routing problem, An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space, Reduction tests for the steiner problem in grapsh, On the history of the Euclidean Steiner tree problem, Construction of the current Steiner network of the second optimality rank, Minimal curvature-constrained networks, Low cost drainage networks, The Steiner minimal network for convex configurations, When facilities coincide: Exact optimality conditions in multifacility location, Cost-minimal trees in directed acyclic graphs, The local Steiner problem in normed planes, Cost allocation for steiner trees, Steiner's problem and fagnano's result on the sphere, Some remarks on the Steiner problem, Thirty‐five‐point rectilinear steiner minimal trees in a day, The Steiner problem on surfaces of revolution, Local search for the Steiner tree problem in the Euclidean plane, Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon, Modeling of optimal networks by means of linkages, Bifurcations of binary types of Steiner minimal networks in the plane, An algorithm for the steiner problem in graphs, Minimal binary trees with a regular boundary: The case of skeletons with five endpoints, An overview of exact algorithms for the Euclidean Steiner tree problem inn-space, Insight into the computation of Steiner minimal trees in Euclidean space of general dimension, An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric, IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE, Steiner tree problems, Interconnecting networks in the plane: The steiner case, A short proof of a result of Pollak on Steiner minimal trees, A class of full Steiner minimal trees, The Steiner ratio conjecture is true for five points, Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs, Planar Manhattan local minimal and critical networks, A linear time algorithm for full Steiner trees, A variational approach to the Steiner network problem, A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space