THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS
M. DIANE and J. PLESNIK
Abstract.
Three practically successful heuristics are presented and analysed.\break They include the known spanning tree heuristic (STH). One of the heuristics chooses Steiner vertices by STH and the other two heuristics according to their sum of all distances to the special vertices. The theoretical worst-case performance ratio remains the same as for STH.
Compressed Postscript 
