How to find Steiner minimal trees in euclideand-space
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6), 137-177
- https://doi.org/10.1007/bf01758756
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Exact computation of Steiner minimal trees in the planeInformation Processing Letters, 1986
- A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREESAnnals of the New York Academy of Sciences, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- Efficient Planarity TestingJournal of the ACM, 1974
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- On Fermat's Problem on the Surface of a SphereMathematics Magazine, 1972
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957