steiner tree

The Steiner tree problem is a combinatorial optimization problem in mathematics. It involves a graph G with a set of vertices. A Steiner tree is a tree of minimum total length whose vertices are a superset of the vertices in G. Those vertices that are not in G are called Steiner points. This problem might look similar to minimum spanning tree (MST). The main difference is that, in the minimum spanning tree problem, we are looking for a tree that connects all vertices of G. In Steiner tree problem, we add extra vertices to reduce the overall length. The Steiner tree problem has applications in circuit layout or network design. The Steiner tree problem is NP-complete. Some restricted cases can be solved in polynomial time. In practice, heuristics are used. One common approximation to the Steiner tree problem is to compute the Euclidean minimum spanning tree.

<< Previous

Word Browser

Next >>

california zephyr
jsus de montral
city of new orleans
the machines of god
paleoanthropology
hiawatha (amtrak)
lake shore limited
burak eldem
carbon carbon bond
southwest chief
aldol

texas eagle
2012: appointment with marduk
jie (ruler)
northern pacific railway
federal department of justice and police
king curtis
thutmose i
milo djukanovic
chiac language
communes of the bas rhin dpartement sorted by arrondissements and cantons
1971 in gay rights

erma franklin
turkana boy
el arish
1972 in gay rights
federal department of economic affairs
hosho
lake turkana
spoonerville
quantrix
philip armour
north korean abductions of japanese

fernando gonzlez
guineapig (movie)
vmu
the colour out of space
madeline bassett
battle of krithia vineyard
chicago, burlington and quincy railroad
cuban five
whatever and ever amen
andrew niccol
identification key