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