Steiner tree

noun1

1. •
   The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.