任意图上加权b-匹配的腔方法的精确性及其与线性规划的关系
On the exactness of the cavity method for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs
摘要：
我们考虑在任意图上寻找最小权b-匹配的一般问题。我们证明了，只要线性规划松弛的问题没有分数的解决方案，然后腔或信念传播方程收敛到正确的解决方案，同步和异步更新。
英文摘要：
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
