Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Distributed, iterative algorithms operating with minimal data structure while performing little computation per iteration are popularly known as message passing in the recent literature. Belief propagation (BP), a prototypical message-passing algorithm, has gained a lot of attention across disciplin...
Main Authors: | Gamarnik, David, Shah, Devavrat, Wei, Yehua |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2012
|
Online Access: | http://hdl.handle.net/1721.1/72573 https://orcid.org/0000-0001-8898-8778 https://orcid.org/0000-0003-0737-3259 |
Similar Items
-
Belief Propagation for Min-Cost Network Flow: Convergence & Correctness
by: Gamarnik, David, et al.
Published: (2012) -
Network security and min-cost max-flow problem
by: Dahan, Mathieu
Published: (2016) -
Optimal road matching by relaxation to min-cost network flow
by: Hangbin Wu, et al.
Published: (2022-11-01) -
On the Quickest Flow Problem in Dynamic Networks - a Parametric Min-Cost Flow Approach
by: Lin, Maokai, et al.
Published: (2015) -
Right-convergence of sparse random graphs
by: Gamarnik, David
Published: (2014)