.png){kind=icon}
返回
Cost additive rules in minimum cost spanning tree problems with multiple sources
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03868-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple sources called Kruskal sharing rules. This family is characterized by cone-wise additivity and independence of irrelevant trees. We also investigate some subsets of this family and provide axiomatic characterizations of them. The first subset is obtained by adding core selection. The second is obtained by adding core selection and equal treatment of source costs.
Keyword:
Minimum cost spanning tree problems
Multiple sources
Kruskal sharing rules
Axiomatic characterizations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Revision of the genus Salganea Stål (Blattodea, Blaberidae, Panesthiinae) from China, with descriptions of three new species.png)
ZooKeys
OAAI
ZooKeysIF0
OAAI分享收藏分享收藏分享收藏Automatic text classification of prostate cancer malignancy scores in radiology reports using NLP models利用NLP模型对放射学报告中的前列腺癌恶性程度评分进行自动文本分类
OAAI
OAAI分享收藏
查看更多内容