The role of Steiner hulls in the solution to Steiner tree problems
From MaRDI portal
Publication:1179758
DOI10.1007/BF02067240zbMath0736.90075MaRDI QIDQ1179758
Publication date: 27 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Trees (05C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (3)
A primer of the Euclidean Steiner problem ⋮ Improved computation of plane Steiner minimal trees ⋮ Two new criteria for finding Steiner hulls in Steiner tree problems
Cites Work
- Unnamed Item
- A decomposition theorem on Euclidean Steiner minimal trees
- Shortest enclosing walks and cycles in embedded graphs
- An edge elimination test for the Steiner problem in graphs
- A fast algorithm for Steiner trees
- Polynomially solvable special cases of the Steiner problem in planar networks
- An efficient algorithm for determining the convex hull of a finite planar set
- On the Problem of Steiner
- Steiner trees, partial 2–trees, and minimum IFI networks
- An algorithm for the steiner problem in the euclidean plane
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Convexity and the Steiner tree problem
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- Steiner problem in networks: A survey
- An Approximation Scheme for Finding Steiner Trees with Obstacles
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Reduction tests for the steiner problem in grapsh
- Optimal enclosing regions in planar graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Rectilinear steiner trees: Efficient special-case algorithms
- Computing the Reliability of Complex Networks
- Steiner Trees for Ladders
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Faster exact algorithms for steiner trees in planar networks
- Linear-time computation of optimal subgraphs of decomposable graphs
- On Steiner’s Problem with Rectilinear Distance
- Steiner Minimal Trees
- On the Efficiency of the Algorithm for Steiner Minimal Trees
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- An algorithm for the steiner problem in graphs
This page was built for publication: The role of Steiner hulls in the solution to Steiner tree problems