On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642)
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: On the set of extreme core allocations for minimal cost spanning tree problems |
scientific article; zbMATH DE number 6722551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the set of extreme core allocations for minimal cost spanning tree problems |
scientific article; zbMATH DE number 6722551 |
Statements
On the set of extreme core allocations for minimal cost spanning tree problems (English)
0 references
23 May 2017
0 references
minimal cost spanning tree problems
0 references
extreme core allocations
0 references
reduced game
0 references
Bird solution
0 references
folk solution
0 references
cycle-complete solution
0 references
0 references
0 references
0.8882915
0 references
0.8828304
0 references
0.8828304
0 references
0.88168937
0 references
0.8807862
0 references
0.8805468
0 references
0.8797496
0 references
0.87950027
0 references
0.8776844
0 references
