Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem
DOI10.1287/moor.1090.0380zbMath1230.68183arXiv0902.0585OpenAlexW2141499077MaRDI QIDQ3169045
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.0585
local weak convergencebelief propagationcorrelation decayPoisson weighted infinite treerandom assignment problem
Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
This page was built for publication: Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem