On the hardness of full Steiner tree problems (Q491161)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6475113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of full Steiner tree problems |
scientific article; zbMATH DE number 6475113 |
Statements
On the hardness of full Steiner tree problems (English)
0 references
24 August 2015
0 references
full Steiner tree
0 references
bottleneck full Steiner tree
0 references
0 references
0.9320096373558044
0 references
0.8838464021682739
0 references
0.880517840385437
0 references
0.8709900975227356
0 references
0.863182783126831
0 references
