Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K. (1988). A Faster Approximation Algorithm for the Steiner Problem in Graphs. Information Processing Letters, 27(3), 125-128. doi:10.1016/0020-0190(88)90066-X.