For a connected graph G and a subset S of its vertices, the Steiner tree problem consists of finding a minimum-size connected subgraph containing S. The Steiner distance of S is the size of a Steiner ...