Steiner Tree Problem

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 of all edges. The difference between the Steiner tree problem and the minimum spanning tree problem is that, in the Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices. It has been proved that the resulting connection is a tree, known as the Steiner tree. There may be several Steiner trees for a given set of initial vertices.

The Steiner tree problem has applications in circuit layout or network design. Most versions of the Steiner tree problem are NP-complete. In fact, one of these was among Karp's original 21 NP-complete problems. Some restricted cases can be solved in polynomial time. In practice, heuristics are used.

Read more about Steiner Tree Problem:  Euclidean Steiner Tree, Rectilinear Steiner Tree, Generalization of Minimum Steiner Tree, Steiner Ratio

Famous quotes containing the words steiner, tree and/or problem:

    We know that a man can read Goethe or Rilke in the evening, that he can play Bach and Schubert, and go to his day’s work at Auschwitz in the morning.
    —George Steiner (b. 1929)

    Here is a hero who did nothing but shake the tree as soon as the fruit was ripe. Does this seem to be too small a thing to you? Then take a good look at the tree he shook.
    Friedrich Nietzsche (1844–1900)

    One thing in any case is certain: man is neither the oldest nor the most constant problem that has been posed for human knowledge.
    Michel Foucault (1926–1984)