Mathematics
V. J. Rayward-Smith
1983International Journal of Mathematical Education in Science and Technology
tlooto Summary
A heuristic algorithm which runs in polynomial time and produces a near minimal solution to the computation of a minimal Steiner tree for a general weighted graph is described.
Abstract
Abstract is not available.
Citation format
RAYWARD-SMITH, V. J. The computation of nearly minimal steiner trees in graphs. International Journal of Mathematical Education in Science and Technology, 1983, 14: 15–23.