|نسخه تمام متن
|4 صفحه PDF
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.
Journal: Operations Research Letters - Volume 44, Issue 5, September 2016, Pages 598–601