On the Efficiency of the Algorithm for Steiner Minimal Trees

DOI10.1137/0118014zbMath0218.90064OpenAlexW2156503228MaRDI QIDQ5623537

E. J. Cockayne

Publication date: 1970

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0118014

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (21)

Exact computation of Steiner minimal trees in the plane ⋮ Symmetrization theorem of full Steiner trees ⋮ Hexagonal coordinate systems and Steiner minimal trees ⋮ Variational approach and Steiner minimal trees on four points ⋮ Steiner polygons in the Steiner problem ⋮ Steiner minimal trees on regular polygons with centre ⋮ Full minimal Steiner trees on lattice sets ⋮ A decomposition theorem on Euclidean Steiner minimal trees ⋮ Determining shortest networks in the Euclidean plane ⋮ Some problems in discrete optimization ⋮ A primer of the Euclidean Steiner problem ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ Improved computation of plane Steiner minimal trees ⋮ Steiner minimal trees for a class of zigzag lines ⋮ Two new criteria for finding Steiner hulls in Steiner tree problems ⋮ Construction of the current Steiner network of the second optimality rank ⋮ A model for determining the cost-effectiveness of T1 transmission in certain integrated networks ⋮ Using structured steiner trees for hierarchical global routing ⋮ Steiner minimal trees for bar waves ⋮ Steiner's problem and fagnano's result on the sphere ⋮ A linear time algorithm for full Steiner trees

This page was built for publication: On the Efficiency of the Algorithm for Steiner Minimal Trees