Zelikovsky, A.(1992). A faster 11/6-approximation algorithm for the Steiner tree problem in graphs (MPI-I-92-122). Saarbrücken: Max-Planck-Institut für Informatik.