Problems with generalized Steiner problems (Q1186806)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Problems with generalized Steiner problems |
scientific article; zbMATH DE number 37177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Problems with generalized Steiner problems |
scientific article; zbMATH DE number 37177 |
Statements
Problems with generalized Steiner problems (English)
0 references
28 June 1992
0 references
Given an undirected graph \(G\) with weights on its edges and a subset \(A\) of vertices of \(G\), a Steiner tree for \(A\) is a connected subgraph of \(G\) containing \(A\) whose sum of edge weights is minimal. This note briefly introduces some extensions of Steiner trees in graphs.
0 references
generalized Steiner problems
0 references
Steiner tree
0 references
0 references
