Belief propagation for min-cost network flow: convergence & correctness
暂无分享,去创建一个
[1] Riccardo Zecchina,et al. A rigorous analysis of the cavity equations for the minimum spanning tree , 2009, ArXiv.
[2] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.
[3] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[4] William T. Freeman,et al. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.
[5] Benjamin Van Roy,et al. Convergence of Min-Sum Message-Passing for Convex Optimization , 2010, IEEE Transactions on Information Theory.
[6] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[7] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[8] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[9] Christian Borgs,et al. Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions , 2007, SIAM J. Discret. Math..
[10] William T. Freeman,et al. Understanding belief propagation and its generalizations , 2003 .
[11] M. Bayati,et al. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality , 2008, IEEE Transactions on Information Theory.
[12] Benjamin Van Roy,et al. Convergence of Min-Sum Message Passing for Quadratic Optimization , 2006, IEEE Transactions on Information Theory.
[13] C. Borgs,et al. On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs , 2008, 0807.3159.
[14] Satoru Fujishige,et al. A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm , 1986, Math. Program..
[15] A. Schrijver. A Course in Combinatorial Optimization , 1990 .
[16] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[17] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[18] N. Ruozzi,et al. s-t paths using the min-sum algorithm , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[19] Andrea Montanari,et al. Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation , 2007, ArXiv.
[20] Sanjeev Arora,et al. Message-Passing Algorithms and Improved LP Decoding , 2012, IEEE Trans. Inf. Theory.
[21] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[22] D. Bertsekas. Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.
[23] Robert J. McEliece,et al. The generalized distributive law , 2000, IEEE Trans. Inf. Theory.
[24] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[25] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[26] Dmitry M. Malioutov,et al. Linear programming analysis of loopy belief propagation for weighted matching , 2007, NIPS.
[27] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[28] William J. Cook,et al. Combinatorial optimization , 1997 .
[29] Dmitry M. Malioutov,et al. Walk-Sums and Belief Propagation in Gaussian Graphical Models , 2006, J. Mach. Learn. Res..
[30] G. Horn. Iterative decoding and pseudo-codewords , 1999 .
[31] Benjamin Van Roy,et al. Convergence of the Min-Sum Message Passing Algorithm for Quadratic Optimization , 2006, ArXiv.
[32] Devavrat Shah,et al. Message Passing for Maximum Weight Independent Set , 2008, IEEE Transactions on Information Theory.
[33] Yashodhan Kanoria,et al. Fast convergence of natural bargaining dynamics in exchange networks , 2010, SODA '11.
[34] ShahDevavrat,et al. Belief Propagation for Min-Cost Network Flow , 2012 .
[35] Devavrat Shah,et al. Belief Propagation for Min-Cost Network Flow: Convergence and Correctness , 2010, Oper. Res..