Sciweavers

TIT
2011
209views more  TIT 2011»
12 years 11 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 4 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman