A faster approximation algorithm for the Steiner problem in graphs (Q5903117): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:06, 5 March 2024
scientific article; zbMATH DE number 3952028
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster approximation algorithm for the Steiner problem in graphs |
scientific article; zbMATH DE number 3952028 |
Statements
A faster approximation algorithm for the Steiner problem in graphs (English)
0 references
1986
0 references
Steiner tree
0 references
distance graph
0 references
generalized minimum spanning tree
0 references
