Steiner Tree Problem
CHF 57.10
Auf Lager
SKU
B14E147NECT
1 Verfügbar 
Kostenloser Versand
Geliefert zwischen Mi., 05.11.2025 und Do., 06.11.2025
Details
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.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130333881
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H8mm x B220mm x T150mm
- Jahr 2010
- EAN 9786130333881
- Format Kartonierter Einband
- ISBN 978-613-0-33388-1
- Titel Steiner Tree Problem
- Untertitel Jakob Steiner, Combinatorial Optimization, Minimum spanning Tree, Tree (graph theory), Electrical Network, Network Planning and Design
- Gewicht 193g
- Herausgeber Betascript Publishers
- Anzahl Seiten 132
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
