A primer of the Euclidean Steiner problem

DOI10.1007/BF02061658zbMath0741.90083OpenAlexW1998117457MaRDI QIDQ1179729

Frank K. Hwang

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02061658

zbMATH Keywords

surveyEuclidean planeshortest networkEuclidean Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Cut and patch Steiner trees for ladders ⋮ Efficiently solvable special cases of hard combinatorial optimization problems ⋮ OR Utopia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner minimal trees for bar waves
• A variational approach to the Steiner network problem
• 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
• A decomposition theorem on Euclidean Steiner minimal trees
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• On Steiner trees for bounded point sets
• Analytic formulas for full Steiner trees
• The Steiner ratio for five points
• The role of Steiner hulls in the solution to Steiner tree problems
• The Steiner ratio conjecture for cocircular points
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• Graham's problem on shortest networks for points on a circle
• Steiner minimal trees for a class of zigzag lines
• The Steiner tree problem
• Some remarks on the Steiner problem
• A short proof of a result of Pollak on Steiner minimal trees
• A class of full Steiner minimal trees
• The shortest path and the shortest road through n points
• On the Problem of Steiner
• An Improved Algorithm for Steiner Trees
• A New Bound for the Steiner Ratio
• Steiner Minimal Trees on Zig-Zag Lines
• An algorithm for the steiner problem in the euclidean plane
• Steiner Minimal Tree for Points on a Circle
• Convexity and the Steiner tree problem
• A Simple Proof of the Steiner Ratio Conjecture for Five Points
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Crossing-Free Subgraphs
• The shortest network under a given topology
• A Lower Bound for the Steiner Tree Problem
• Steiner Trees for Ladders
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• The Complexity of Computing Steiner Minimal Trees
• Steiner Trees on a Checkerboard
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• The Generation of Minimal Trees with a Steiner Topology

This page was built for publication: A primer of the Euclidean Steiner problem