Noun
Steiner tree (plural Steiner trees) (graph theory) The minimum-weight connected subgraph of a graph that includes all the vertices of that graph.