On the Problem of Steiner

Cited In (92)

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