Steiner tree problem
（重定向自Steiner Trees）
The Steiner tree problem, motorway problem, or minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization, which may be formulated in a number of settings, with the common part being that it is required to find the shortest interconnect for a given set of objects.