Steiner tree problems
- 1 January 1992
- Vol. 22 (1) , 55-89
- https://doi.org/10.1002/net.3230220105
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.Keywords
This publication has 183 references indexed in Scilit:
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Computational complexity of inferring phylogenies from chromosome inversion dataJournal of Theoretical Biology, 1987
- Chordality properties on graphs and minimal conceptual connections in semantic data modelsJournal of Computer and System Sciences, 1986
- Subclass of the Steiner problems on a plane with rectilinear metricCybernetics and Systems Analysis, 1986
- Maximum savings in the Steiner problem in phylogenyJournal of Theoretical Biology, 1984
- Computationally difficult parsimony problems in phylogenetic systematicsJournal of Theoretical Biology, 1983
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational timeMathematical Biosciences, 1982
- An O (n2) heuristic algorithm for the directed Steiner minimal tree problemApplied Mathematical Modelling, 1980
- A method for constructing maximum parsimony ancestral amino acid sequences on a given networkJournal of Theoretical Biology, 1973
- Clustering in numerical cladistics: A minimum-length directed tree problemMathematical Biosciences, 1968