An efficient branch and bound algorithm for the CMST problem (Q3513694)
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 5308182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient branch and bound algorithm for the CMST problem |
scientific article; zbMATH DE number 5308182 |
Statements
6 August 2008
0 references
minimum spanning tree
0 references
branch and bound
0 references
search tree
0 references
pruning
0 references
0.821954607963562
0 references
0.8213549256324768
0 references
0.8091685771942139
0 references
0.8086341023445129
0 references
