A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Gustavo Bergantiños / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91B32 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6053598 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-hop minimum cost spanning tree problems | |||
Property / zbMATH Keywords: \(k\)-hop minimum cost spanning tree problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bankruptcy problems | |||
Property / zbMATH Keywords: bankruptcy problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constrained equal awards rule | |||
Property / zbMATH Keywords: constrained equal awards rule / rank | |||
Normal rank |
Revision as of 00:30, 30 June 2023
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