Technical Report Number
In this paper we consider the probable performance of three polynomial time approximation algorithms for the Steiner tree problem with respect to a specific random graph model. The Steiner problem asks us to find a minimum cost spanning subgraph (tree) for a subset D of modes in a graph.
Waxman, Bernard M., "Probable Performance of Steiner Tree Algorithms" Report Number: WUCS-88-04 (1988). All Computer Science and Engineering Research.
Permanent URL: http://dx.doi.org/10.7936/K7B856GR