A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:02, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cost allocation rule for \(k\)-hop minimum cost spanning tree problems |
scientific article |
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
