A practical algorithm for the minimum rectilinear Steiner tree

DOI10.1007/BF02951931zbMath0947.68122OpenAlexW2069178743MaRDI QIDQ1966510

Jun Ma, Bo Yang, Shaohan Ma

Publication date: 28 May 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02951931

zbMATH Keywords

minimum rectilinear Steiner tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Steiner tree problem
• On Steiner’s Problem with Rectilinear Distance

This page was built for publication: A practical algorithm for the minimum rectilinear Steiner tree