Steiner Minimal Trees
From MaRDI portal
Publication:5542568
DOI10.1137/0116001zbMath0159.22001MaRDI QIDQ5542568
Publication date: 1968
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/46e57939baff2ec484b2e0f5c4b78f9129e710e9
05C05: Trees
Related Items
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\), Determining shortest networks in the Euclidean plane, Geometry and topology of local minimal 2-trees, Unnamed Item, A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ, Cost-minimal trees in directed acyclic graphs, Some problems in discrete optimization, The steiner problem in graphs, Minimum-distance zoning in transportation problems, A Conjecture of Gilbert and Pollak on Minimal Trees, A faster approximation algorithm for the Steiner problem in graphs, A faster approximation algorithm for the Steiner problem in graphs, On the solution of the generalized steiner problem by the subgradient method, Approximations for Steiner trees with minimum number of Steiner points, Steiner minimal trees for bar waves, Minimum-weight two-connected spanning networks, On better heuristics for Steiner minimum trees, Lower bounds for rectilinear Steiner trees in bounded space, Numerical minimization of geometrical type problems related to calculus of variations, A variational approach to the Steiner network problem, A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space, An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach, Steiner ratio for hyperbolic surfaces., Canonical decompositions of piecewise affine mappings, polyhedra-traces, and geometrical variational problems, An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space, Comparison of distances between measures, The Steiner ratio conjecture is true for five points, A linear time algorithm for full Steiner trees, Hexagonal coordinate systems and Steiner minimal trees, Steiner minimal trees on sets of four points, A Steiner tree associated with three quarks, An algorithm for determining an opaque minimal forest of a convex polygon, A decomposition theorem on Euclidean Steiner minimal trees, Fast heuristic algorithms for rectilinear Steiner trees, Cost of sequential connection for points in space, The Steiner problem with edge lengths 1 and 2, A fast algorithm for Steiner trees, The Steiner problem in phylogeny is NP-complete, Analytic formulas for full Steiner trees, The Steiner ratio conjecture for six points, Some upper bounds for minimal trees, A primer of the Euclidean Steiner problem, The Steiner ratio for five points, On Steiner ratio conjectures, Minimal length tree networks on the unit sphere, The role of Steiner hulls in the solution to Steiner tree problems, Steiner minimal trees for three points with one convex polygonal obstacle, The Steiner ratio conjecture for cocircular points, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, How to find Steiner minimal trees in Euclidean \(d\)-space, On Steiner minimal trees with \(L_ p\) distance, Graham's problem on shortest networks for points on a circle, Steiner minimal trees for a class of zigzag lines, Two new criteria for finding Steiner hulls in Steiner tree problems, Worst-case minimum rectilinear Steiner trees in all dimensions, A heuristic for Euclidean and rectilinear Steiner problems, Supportability of network cost functions, Heuristics for the Steiner problem in graphs, Some remarks on the Steiner problem, Neural and delay based heuristics for the Steiner problem in networks, Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs, A neural network for the Steiner minimal tree problem, Symmetrization theorem of full Steiner trees, Some results on greedy algorithm conjectures, Variational approach and Steiner minimal trees on four points, Steiner polygons in the Steiner problem, A continuous version of a result of Du and Hwang, On the Steiner ratio in 3-space, Full minimal Steiner trees on lattice sets, The Steiner ratio for the dual normed plane, Faster geometric \(k\)-point MST approximation, Non-crossing of plane minimal spanning and minimal T1 networks, The Steiner tree problem in orientation metrics, The Steiner ratio of high-dimensional Banach--Minkowski spaces., Minimum Steiner trees in normed planes, Local search for the Steiner tree problem in the Euclidean plane, A short proof of a result of Pollak on Steiner minimal trees, A class of full Steiner minimal trees, Steiner trees in uniformly quasi-bipartite graphs., On greedy heuristic for Steiner minimum trees, On component-size bounded Steiner trees, Steiner minimal trees on regular polygons with centre, A tight lower bound for the Steiner ratio in Minkowski planes, A direct solution of allocation problems, Steiner minimal trees in \(L^ 2_ p\), Steiner distance and convexity in graphs, Cache placement in sensor networks under an update cost constraint, Improved approximation results for the minimum energy broadcasting problem, Generalizations on the parsimony question in evolution, The minimal spanning tree and the upper box dimension, A New Bound for the Steiner Ratio, Unnamed Item, Steiner Minimal Trees on Zig-Zag Lines, The 3‐vertex single source Weber location problem, Steiner Minimal Tree for Points on a Circle, Weber's problem and weiszfeld's algorithm in general spaces, Steiner's problem and fagnano's result on the sphere, The 1-Steiner-Minimal-Tree problem in Minkowski-spaces, Locating the vertices of a steiner tree in an arbitrary metric space, Unnamed Item, Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon
