On the history of the Euclidean Steiner tree problem

DOI10.1007/S00407-013-0127-ZzbMath1295.05002OpenAlexW1992380975WikidataQ61714599 ScholiaQ61714599MaRDI QIDQ2249438

Martin Zachariasen, Doreen Anne Thomas, Ronald L. Graham, Marcus Brazil

Publication date: 1 July 2014

Published in: Archive for History of Exact Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/282844

zbMATH Keywords

shortest network

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) History of combinatorics (05-03)

Related Items (27)

Heat flow for harmonic maps from graphs into Riemannian manifolds ⋮ Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) ⋮ Technical note: the expected length of an orderly path ⋮ Approximate Euclidean Steiner trees ⋮ The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy ⋮ Counting tripods on the torus ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ Rate of cluster decomposition via Fermat-Steiner point ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ The ℓ ^p -metrization of functors with finite supports ⋮ A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) ⋮ Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane ⋮ Nonstandard \(n\)-distances based on certain geometric constructions ⋮ Minimal Networks: A Review ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Unnamed Item ⋮ Shortest directed networks in the plane ⋮ On the restricted 1-Steiner tree problem ⋮ Complexity of Steiner Tree in Split Graphs - Dichotomy Results ⋮ Outer linear measure of connected sets via Steiner trees ⋮ Bifurcations of binary types of Steiner minimal networks in the plane ⋮ Bifurcations of minimal fillings for four points on the Euclidean plane ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space ⋮ On the restricted \(k\)-Steiner tree problem ⋮ Fermat's point from five perspectives ⋮ Weberian focal-directorial curves. Geometric genesis and form variation ⋮ The completion of the hyperspace of finite subsets, endowed with the $\ell ^1$-metric

Uses Software

• GeoSteiner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner minimal trees for regular polygons
• Steiner minimal trees on sets of four points
• The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829
• The anonymous professor Gergonne
• Some remarks on the Steiner problem
• The Steiner ratio of high-dimensional Banach--Minkowski spaces.
• Some applications of point-set methods
• Fully gated graphs: Recognition and convex operations
• Steiner Trees for Terminals Constrained to Curves
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• On the Problem of Steiner
• Un texte de philosophie mathématique de Gergonne
• On Steiner's network problem
• The Complexity of Computing Steiner Minimal Trees
• Euclidean Steiner minimum trees: An improved exact algorithm
• On Steiner’s Problem with Rectilinear Distance
• Steiner Minimal Trees
• On the Steiner Problem
• Soap Film Experiments with Minimal Surfaces
• 5000 years of geometry. History, cultures, people

This page was built for publication: On the history of the Euclidean Steiner tree problem