On the history of the Euclidean Steiner tree problem

DOI10.1007/s00407-013-0127-zzbMath1295.05002WikidataQ61714599 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

05C05: Trees

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C12: Distance in graphs

05-03: History of combinatorics

Related Items

The completion of the hyperspace of finite subsets, endowed with the $\ell ^1$-metric, Fermat's point from five perspectives, A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs, Unnamed Item, Counting tripods on the torus, A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$, 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, On the restricted 1-Steiner tree problem, 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, On the restricted \(k\)-Steiner tree problem, Weberian focal-directorial curves. Geometric genesis and form variation, 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, The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy, Shortest directed networks in the plane, Approximate Euclidean Steiner trees, Rate of cluster decomposition via Fermat-Steiner point, Nonstandard \(n\)-distances based on certain geometric constructions, Complexity of Steiner Tree in Split Graphs - Dichotomy Results, An overview of exact algorithms for the Euclidean Steiner tree problem inn-space, Minimal Networks: A Review

Uses Software

• GeoSteiner

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item