Minimum cost spanning tree problems as value sharing problems (Q2689423)
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 7661861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost spanning tree problems as value sharing problems |
scientific article; zbMATH DE number 7661861 |
Statements
Minimum cost spanning tree problems as value sharing problems (English)
0 references
10 March 2023
0 references
minimum cost spanning tree
0 references
value sharing
0 references
cycle-complete solution
0 references
folk solution
0 references
0 references
0 references
0 references
0 references
0 references
0.8949596
0 references
0.89298046
0 references
0.89053535
0 references
0.88591105
0 references
0.8853545
0 references
0.88224125
0 references
0.88194585
0 references
