On the Problem of Steiner

Cited in

(96)

The Steiner ratio conjecture is true for five points
A linear time algorithm for full Steiner trees
Exact computation of Steiner minimal trees in the plane
Hexagonal coordinate systems and Steiner minimal trees
Steiner minimal trees for regular polygons
Steiner minimal trees on sets of four points
The Steiner problem on a surface
A Steiner tree associated with three quarks
Analytic formulas for full Steiner trees
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
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
The Steiner minimal network for convex configurations
When facilities coincide: Exact optimality conditions in multifacility location
Some remarks on the Steiner problem
Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
Symmetrization theorem of full Steiner trees
Some results on greedy algorithm conjectures
On the Steiner ratio in 3-space
Full minimal Steiner trees on lattice sets
Cut and patch Steiner trees for ladders
Non-crossing of plane minimal spanning and minimal T1 networks
The Steiner tree problem in orientation metrics
Minimal curvature-constrained networks
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
Planar Manhattan local minimal and critical networks
Computing Steiner points for gradient-constrained minimum networks
On the structure and complexity of the 2-connected Steiner network problem in the plane
Construction of the current Steiner network of the second optimality rank
Modeling of optimal networks by means of linkages
Bifurcations of binary types of Steiner minimal networks in the plane
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Analytic deformations of minimal networks
Bifurcations of Steiner tree topologies in the plane
On the history of the Euclidean Steiner tree problem
Geometry-experiment algorithm for Steiner minimal tree problem
Approximate Euclidean Steiner trees
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
Computing the optimal bridge between two convex polygons
Minimal networks: a review
Maximising the worth of nascent networks
IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
A New Bound for the Steiner Ratio
Steiner Minimal Trees on Zig-Zag Lines
The Gilbert and Pollak conjecture—a generalization
An algorithm for the steiner problem in the euclidean plane
Problem reduction methods and a tree generation algorithm for the steiner network problem
Convexity and the Steiner tree problem
Steiner problem in networks: A survey
A solvable routing problem
Reduction tests for the steiner problem in grapsh
Steiner's problem and fagnano's result on the sphere
An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon
Locating the vertices of a steiner tree in an arbitrary metric space
Low cost drainage networks
Cost allocation for steiner trees
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R^d
A delaunay triangulation‐based heuristic for the euclidean steiner problem
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R² and R³
Geometry and topology of local minimal 2-trees
The local Steiner problem in normed planes
Thirty‐five‐point rectilinear steiner minimal trees in a day
Interconnecting networks in the plane: The steiner case
GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM
An O(N²) heuristic for steiner minimal trees in E³
Cost-minimal trees in directed acyclic graphs
Computation of Galois Group Elements of a Polynomial Equation
Steiner's problem in graphs and its implications
An algorithm for the steiner problem in graphs
Steiner tree problems
The exchange value embedded in a transport system
A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
An initial study of budgeted Steiner networks
O(n log n)-average-time algorithm for shortest network under a given topology
A Lagrangian program detecting the weighted Fermat-Steiner-Fréchet multitree for a Fréchet N-multisimplex in Euclidean N-space
Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
Efficient algorithms for Euclidean Steiner minimal tree on near-convex terminal sets
Steiner trees with infinitely many terminals on the sides of an angle
Periodic double tilings of the plane
The Steiner problem on surfaces of revolution
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
An improved algorithm for computing Steiner minimal trees in Euclidean d-space

This page was built for publication: On the Problem of Steiner

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