Worst-case performance of Rayward-Smith's Steiner tree heuristic
- 8 December 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 29 (6) , 283-287
- https://doi.org/10.1016/0020-0190(88)90225-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- On finding steiner verticesNetworks, 1986
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 1983
- A fast algorithm for Steiner treesActa Informatica, 1981