Cost-minimal trees in directed acyclic graphs
- 1 February 1974
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 18 (1) , 59-67
- https://doi.org/10.1007/bf01949715
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Steiner's problem in graphs and its implicationsNetworks, 1971
- Clustering in numerical cladistics: A minimum-length directed tree problemMathematical Biosciences, 1968
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966
- A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENYEvolution, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961