Steiner Tree Problem
(Sprache: Englisch)
High Quality Content by WIKIPEDIA articles! 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...
Leider schon ausverkauft
versandkostenfrei
Buch
45.00 €
22 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Steiner Tree Problem “
Klappentext zu „Steiner Tree Problem “
High Quality Content by WIKIPEDIA articles! 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.
Bibliographische Angaben
- 2010, 132 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Herausgeber: Marseken, Susan F., Surhone, Lambert M., Timpledon, Miriam T.
- Verlag: Betascript Publishing
- ISBN-10: 6130333889
- ISBN-13: 9786130333881
Sprache:
Englisch
Kommentar zu "Steiner Tree Problem"
0 Gebrauchte Artikel zu „Steiner Tree Problem“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Steiner Tree Problem".
Kommentar verfassen