A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843)
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 6053598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cost allocation rule for \(k\)-hop minimum cost spanning tree problems |
scientific article; zbMATH DE number 6053598 |
Statements
A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (English)
0 references
6 July 2012
0 references
\(k\)-hop minimum cost spanning tree problems
0 references
bankruptcy problems
0 references
constrained equal awards rule
0 references
0 references
0.8466417193412781
0 references
0.8230984210968018
0 references
0.815660834312439
0 references
0.8155845403671265
0 references
0.8149338364601135
0 references
