Belief Propagation for Minimum Convex-Cost Integral Network Flow
暂无分享,去创建一个
[1] M. Bayati,et al. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality , 2005, IEEE Transactions on Information Theory.
[2] Devavrat Shah,et al. Message Passing for Maximum Weight Independent Set , 2008, IEEE Transactions on Information Theory.
[3] Dmitry M. Malioutov,et al. Belief Propagation and LP Relaxation for Weighted Matching in General Graphs , 2011, IEEE Transactions on Information Theory.
[4] Devavrat Shah,et al. Belief propagation for min-cost network flow: convergence & correctness , 2010, SODA '10.