| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143137 | Operations Research Letters | 2012 | 4 Pages |
Abstract
In this note, we prove that the core of a kk-hop minimum cost spanning tree problem could be empty. We also introduce a cost sharing rule based on bankruptcy problems. We prove that this rule satisfies meaningful properties for these problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
G. Bergantiños, M. Gómez-Rúa, N. Llorca, M. Pulido, J. Sánchez-Soriano,