CentralNotice Steiner tree problem From Wikipedia, the free encyclopedia Jump to: navigation , search Steiner tree for three points A , B , and C (note there are no direct connections between A , B , C ). The Steiner point S is located at the Fermat point of the triangle ABC . Solution for four points—there are two Steiner points, S 1 and S 2 The Steiner tree problem , or the 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. The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network ( graph ) of shortest length, where the length is the sum of the lengths ...