Convergence and correctness of belief propagation for the Chinese postman problem
type: Item
instance of: scholarly article
title: Convergence and correctness of belief propagation for the Chinese postman problem
zbMATH Open document ID: 1433.90131
author: Yanyan Li
published in: Journal of Global Optimization
publication date: 2019-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7139383
zbMATH Keywords: belief propagation (BP)
zbMATH Keywords: message-passing algorithm
zbMATH Keywords: min-sum algorithm
zbMATH Keywords: convergence
zbMATH Keywords: undirected Chinese postman problem
zbMATH Keywords: directed Chinese postman problem
describes a project that uses: apcluster
describes a project that uses: APCluster
MaRDI profile type: Publication
full work available at URL: s10898-019-00749-2
OpenAlex ID: W2914495126
cites work: On the solution-space geometry of random constraint satisfaction problems
cites work: The generalized distributive law
cites work: A rigorous analysis of the cavity equations for the minimum spanning tree
cites work: Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
cites work: Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
cites work: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
cites work: Parallelizing simulated annealing algorithms based on high-performance computer
cites work: A Spectral Approach to Analysing Belief Propagation for 3-Colouring
cites work: The Stochastic Properties of Large Battle Models
cites work: Matching, Euler tours and the Chinese postman
cites work: Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
cites work: Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
cites work: Clustering by Passing Messages Between Data Points
cites work: Q3293678
cites work: Belief propagation for min-cost network flow: convergence and correctness
cites work: Q5519709
cites work: Factor graphs and the sum-product algorithm
cites work: Q3997653
cites work: The capacity of low-density parity-check codes under message-passing decoding
cites work: Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
cites work: Message Passing for Maximum Weight Independent Set
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
cites work: Correctness of belief propagation in Gaussian graphical models of arbitrary topology
Wikidata QID: Q128428088
DOI: 10.1007/S10898-019-00749-2
description: scientific article; zbMATH DE number 7139383