.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Suppose G = (S, T, E) is a bipartite graph, where (S,T) is a bipartition of the vertex set. A beta-assignment is an edge set X subset of or equal to E such that deg(X)(i) = 1 for all i is an element of S. The cardinality beta-assignment problem is to find a beta-assignment X which minimizes beta(X) = max(j is an element of)T deg(X)(j). Suppose we associate every edge with a weight which is a real number. The bottleneck beta-assignment problem is to find a beta-assignment X that minimizes beta(X) and maximizes the minimum edge weight on X. The weighted beta-assignment problem is to find a beta-assignment X that minimizes beta(X) and maximizes the total weights of edges in X. This paper presents O(/SJ//E/)-time algorithms for the cardinality and the bottleneck beta-assignment problems and an O(/S/(2)/T/ + /S//T/(2))-time algorithm for the weighted beta-assignment problem. (C) 1998 Elsevier Science B.V.
Keyword:
assignment
bottleneck
augmenting path
label
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Methylsulfonylmethane and boswellic acids versus glucosamine sulfate in the treatment of knee arthritis: Randomized trial二甲基砜和乳香酸与硫酸氨基葡萄糖在膝关节关节炎治疗中的比较：随机试验.png)
.png)
IF0
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏 没有更多内容
没有更多内容