We study the approximability of three versions of the Steiner tree problem. For the first one where the input graph is only supposed connected, we show that it is not approximable within better than | \ | for any ∊ ∈ (0, 1), where and are the vertex-set of the input graph and the set of...