.png){kind=icon}
返回
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2011.00830.x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a new combinatorial problem, the Min-Degree Constrained Minimum Spanning Tree (md-MST), that can be stated as: given a weighted undirected graph G=(V,E) with positive costs on the edges and a node-degrees function d:V?N, the md-MST is to find a minimum cost spanning tree T of G, where each node i of T either has at least a degree of d(i) or is a leaf node. This problem is closely related to the well-known Degree Constrained Minimum Spanning Tree (d-MST) problem, where the degree constraint is an upper bound instead. The general NP-hardness for the md-MST is established and some properties related to the feasibility of the solutions for this problem are presented, in particular we prove some bounds on the number of internal and leaf nodes. Flow-based formulations are proposed and computational experiments involving the associated Linear Programming (LP) relaxations are presented.
Keyword:
degree constrained spanning tree problems
computational complexity
single-commodity flow formulations
multicommodity flow formulations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏‘A landmark in psychiatric progress’? The role of evidence in the rise and fall of insulin coma therapy“精神病学进步的里程碑”？证据在胰岛素昏迷疗法兴衰中的作用
OAAI
OAAI分享收藏Media and microcarrier surface must be optimized when transitioning mesenchymal stem/stromal cell expansion to stirred tank bioreactors在将间充质干细胞/基质细胞扩增过渡到搅拌式生物反应器时，培养基和微载体表面必须进行优化。
OAAI
OAAI分享收藏
查看更多内容