Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142022 | Operations Research Letters | 2016 | 4 Pages |
Abstract
A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a source. Once the efficient tree is obtained, the addressed question is how to allocate the total cost among the involved agents. One prominent solution in allocating this minimum cost is the so-called Folk solution. Unfortunately, in general, the Folk solution is not easy to compute. We identify a class of mcstmcst problems in which the Folk solution is obtained in an easy way. This class includes elementary cost mcstmcst problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Begoña Subiza, José-Manuel Giménez-Gómez, Josep E. Peris,