The Steiner problem with edge lengths 1 and 2
- 1 September 1989
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 32 (4), 171-176
- https://doi.org/10.1016/0020-0190(89)90039-2
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Worst-case performance of Rayward-Smith's Steiner tree heuristicInformation Processing Letters, 1988
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREESAnnals of the New York Academy of Sciences, 1985
- The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 1983
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968