Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups

被引：0
|
作者：
Lorenzo-Freire, S. [1 ,2 ,4 ]
Gonzalez-Maestro, A. [1 ,2 ,4 ]
Alonso-Meijide, J. M. [3 ,4 ]
机构：
[1] Univ A Coruna, Fac Comp Sci, Dept Math, MODES Res Grp, Campus Elvina, La Coruna 15071, Spain
[2] Univ A Coruna, CITIC, Campus Elvina, La Coruna 15071, Spain
[3] Univ Santiago de Compostela, Dept Stat Math Anal & Optimizat, MODESTYA Res Grp, Fac Sci, Lugo 27002, Spain
[4] CITMAga, Santiago De Compostela 15782, Spain
来源：
DISCRETE APPLIED MATHEMATICS | 2023年 / 338卷
关键词：
Minimum cost spanning tree problems; Kruskal algorithm; Cooperative game theory; Shapley value; Owen value; ALLOCATION;
D O I：
10.1016/j.dam.2023.06.001
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper focuses on the computation of a rule in minimum cost spanning tree problems with groups, which coincides with the Owen value of the cooperative game for the irreducible cost matrix. To this aim, two polynomial-time algorithms are provided. The first of them is based on the steps of Kruskal algorithm whereas the other is based on a painting procedure.& COPY; 2023 Published by Elsevier B.V.
引用
收藏
页码：113 / 124
页数：12
相关论文
共 50 条
12345