A faster approximation algorithm for the Steiner problem in graphs (Q5903117): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00289500 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993553699 / rank | |||
Normal rank |
Latest revision as of 10:20, 30 July 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