Rectilinear steiner trees: Efficient special-case algorithms
From MaRDI portal
Publication:4120589
DOI10.1002/net.3230070104zbMath0351.05102MaRDI QIDQ4120589
Frank K. Hwang, Michael R. Garey, A. V. Aho
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070104
05C05: Trees
Related Items
A probably fast, provably optimal algorithm for rectilinear Steiner trees, The computation of nearly minimal Steiner trees in graphs, Two probabilistic results on rectilinear Steiner trees, Fast heuristic algorithms for rectilinear Steiner trees, The role of Steiner hulls in the solution to Steiner tree problems, How to find Steiner minimal trees in Euclidean \(d\)-space, A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets, Two new criteria for finding Steiner hulls in Steiner tree problems, The point-to-point delivery and connection problems: Complexity and algorithms, The rectilinear class Steiner tree problem for intervals on two parallel lines, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, The Steiner tree problem in orientation metrics, Steiner's problem in double trees, Unnamed Item, Rectilinear Steiner Trees in Rectangle Trees