The Generation of Minimal Trees with a Steiner Topology
From MaRDI portal
Publication:5665121
DOI10.1145/321724.321733zbMath0251.94031OpenAlexW2042477130MaRDI QIDQ5665121
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321724.321733
Trees (05C05) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Geometry-experiment algorithm for Steiner minimal tree problem, On the Steiner ratio in 3-space, A primer of the Euclidean Steiner problem, Minimal length tree networks on the unit sphere, Approximations and lower bounds for the length of minimal Euclidean Steiner trees, How to find Steiner minimal trees in Euclidean \(d\)-space, A heuristic for Euclidean and rectilinear Steiner problems, A model for determining the cost-effectiveness of T1 transmission in certain integrated networks, Cost-minimal trees in directed acyclic graphs, Local search for the Steiner tree problem in the Euclidean plane, A neural network for the Steiner minimal tree problem
