A primer of the Euclidean Steiner problem

DOI10.1007/BF02061658MaRDI QIDQ1179729zbMATH OpenOpenAlexFDO

Authors 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

Euclidean planeEuclidean Steiner problemshortest networksurvey

Mathematics Subject Classification ID

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

Cites work

• A class of full Steiner minimal trees
• A decomposition theorem on Euclidean Steiner minimal trees
• A linear time algorithm for full Steiner trees
• A Lower Bound for the Steiner Tree Problem
• A New Bound for the Steiner Ratio
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• A short proof of a result of Pollak on Steiner minimal trees
• A Simple Proof of the Steiner Ratio Conjecture for Five Points
• A variational approach to the Steiner network problem
• An algorithm for the steiner problem in the euclidean plane
• An Improved Algorithm for Steiner Trees
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Analytic formulas for full Steiner trees
• Convexity and the Steiner tree problem
• Crossing-Free Subgraphs
• Exact computation of Steiner minimal trees in the plane
• Graham's problem on shortest networks for points on a circle
• Hexagonal coordinate systems and Steiner minimal trees
• scientific article; zbMATH DE number 3912403 (Why is no real title available?)
• scientific article; zbMATH DE number 3520428 (Why is no real title available?)
• scientific article; zbMATH DE number 3388861 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• On Steiner trees for bounded point sets
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• On the Problem of Steiner
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Some remarks on the Steiner problem
• Steiner Minimal Tree for Points on a Circle
• Steiner Minimal Trees
• Steiner minimal trees for a class of zigzag lines
• Steiner minimal trees for bar waves
• Steiner minimal trees for regular polygons
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner Trees for Ladders
• Steiner Trees on a Checkerboard
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• The Complexity of Computing Steiner Minimal Trees
• The Generation of Minimal Trees with a Steiner Topology
• The role of Steiner hulls in the solution to Steiner tree problems
• The shortest network under a given topology
• The shortest path and the shortest road through n points
• The Steiner ratio conjecture for cocircular points
• The Steiner ratio conjecture is true for five points
• The Steiner ratio for five points
• The Steiner tree problem

Cited in

(4)

• Cut and patch Steiner trees for ladders
• Efficiently solvable special cases of hard combinatorial optimization problems
• OR Utopia
• scientific article; zbMATH DE number 1670544 (Why is no real title available?)

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

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