Steiner tree problems
F. K. Hwang, Dana Richards · Networks · 1992
Abstract We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up‐to‐date bibliography which covers more than three hundred items.
Cited by 663 works. doi:10.1002/net.3230220105
Authors
References
- Reducibility among Combinatorial Problems
- Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
- Combinatorial optimization: networks and matroids
- A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
- Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
- Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
- The shortest path through many points
- Closest-point problems
- Routing of multipoint connections
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane