Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching

DOI10.7155/jgaa.00310zbMath1276.05090OpenAlexW2785713573MaRDI QIDQ2865023

Kamiel Cornelissen, Heiko Röglin, Bodo Manthey, Tobias Brunsch

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00310

zbMATH Keywords

Belief propagationstatistical inference in graphical models

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Smoothed Analysis of Local Search Algorithms ⋮ Belief propagation for the maximum-weight independent set and minimum spanning tree problems

This page was built for publication: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching