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

DOI10.1109/TIT.2017.2788038MaRDI QIDQ4566720zbMATH OpenOpenAlexFDO

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)