# Steiner problem

### From Glossary

Find a subgraph of a graph, say such that contains (a specified subset of nodes), and is minimized. It is generally assumed When this is the shortest path problem. When this is the (minimum) spanning tree problem.

Find a subgraph of a graph, say such that contains (a specified subset of nodes), and is minimized. It is generally assumed When this is the shortest path problem. When this is the (minimum) spanning tree problem.