A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2011.11.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055690105 / rank | |||
Normal rank |
Revision as of 01:35, 20 March 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