Some generalizations of the steiner problem in graphs

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge‐weighted (undirected) graph. In the more general Node‐weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 1987, Vol.17 (3), p.353-364
Hauptverfasser:	Duin, C. W., Volgenant, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!