5 citations · 5 across the 1 of their papers we have counts for
1 paper
Sungsoo Ahn, Michael Chertkov, Andrew E. Gelfand +2
We study the Maximum Weight Matching (MWM) problem for general graphs through the max-product Belief Propagation (BP) and related Linear Programming (LP). The BP approach provides…