Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality

DOI10.1109/TIT.2017.2788038zbMATH Open1390.94956OpenAlexW2777474322MaRDI QIDQ4566720FDOQ4566720

Authors: Sungsoo Ahn, Michael Chertkov, Andrew E. Gelfand, Sejun Park, Jinwoo Shin 

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2788038

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cited In (1)

• Belief propagation for minimum weight many-to-one matchings in the random complete graph

This page was built for publication: Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566720)