Convexity and the Steiner tree problem
From MaRDI portal
Publication:3789369
DOI10.1002/net.3230180108zbMath0645.90091OpenAlexW2163668690MaRDI QIDQ3789369
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180108
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05)
Related Items (17)
A rectilinear steiner minimal tree algorithm for convex point sets ⋮ Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd ⋮ Shortest enclosing walks and cycles in embedded graphs ⋮ On finding two-connected subgraphs in planar graphs ⋮ A primer of the Euclidean Steiner problem ⋮ Polynomially solvable special cases of the Steiner problem in planar networks ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ On the structure and complexity of the 2-connected Steiner network problem in the plane ⋮ 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 ⋮ Opaque sets ⋮ Minimum-weight two-connected spanning networks ⋮ Opaque Sets ⋮ Computing optimal rectilinear Steiner trees: A survey and experimental evaluation ⋮ The Steiner tree problem for terminals on the boundary of a rectilinear polygon ⋮ On shortest three-edge-connected Steiner networks with Euclidean distance
Cites Work
This page was built for publication: Convexity and the Steiner tree problem
