On the Efficiency of the Algorithm for Steiner Minimal Trees

DOI10.1137/0118014MaRDI QIDQ5623537zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(21)

• A linear time algorithm for full Steiner trees
• Exact computation of Steiner minimal trees in the plane
• Hexagonal coordinate systems and Steiner minimal trees
• A decomposition theorem on Euclidean Steiner minimal trees
• 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
• A model for determining the cost-effectiveness of T1 transmission in certain integrated networks
• Symmetrization theorem of full Steiner trees
• Variational approach and Steiner minimal trees on four points
• Steiner polygons in the Steiner problem
• Full minimal Steiner trees on lattice sets
• Steiner minimal trees on regular polygons with centre
• Construction of the current Steiner network of the second optimality rank
• Using structured steiner trees for hierarchical global routing
• Steiner's problem and fagnano's result on the sphere
• Determining shortest networks in the Euclidean plane
• Some problems in discrete optimization
• Steiner minimal trees for bar waves

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

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