Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578)
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 6033939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm |
scientific article; zbMATH DE number 6033939 |
Statements
13 May 2012
0 references
min-degree constrained minimum spanning tree problem
0 references
branch-and-cut
0 references
0 references
0 references
Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (English)
0 references
0.910690188407898
0 references
0.8985049724578857
0 references
0.8761019706726074
0 references
0.8639087080955505
0 references
