A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221)
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: A note on A faster approximation algorithm for the Steiner problem in graphs |
scientific article; zbMATH DE number 23335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on ''A faster approximation algorithm for the Steiner problem in graphs'' |
scientific article; zbMATH DE number 23335 |
Statements
A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (English)
0 references
26 June 1992
0 references
program specification
0 references
Steiner tree approximation algorithm
0 references
0.9711516
0 references
0.9711516
0 references
0.95557046
0 references
0.9223451
0 references
0.9218725
0 references
