Convergence and correctness of belief propagation for the Chinese postman problem
DOI10.1007/S10898-019-00749-2zbMATH Open1433.90131OpenAlexW2914495126WikidataQ128428088 ScholiaQ128428088MaRDI QIDQ2010094FDOQ2010094
Authors: Yanyan Li 
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00749-2
Recommendations
- Belief propagation for min-cost network flow: convergence and correctness
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- scientific article; zbMATH DE number 6297707
- Belief propagation for the maximum-weight independent set and minimum spanning tree problems
- Smoothed analysis of belief propagation for minimum-cost flow and matching
convergencemessage-passing algorithmundirected Chinese postman problembelief propagation (BP)directed Chinese postman problemmin-sum algorithm
Cites Work
- Clustering by passing messages between data points
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- Title not available (Why is that?)
- Factor graphs and the sum-product algorithm
- The capacity of low-density parity-check codes under message-passing decoding
- On the solution-space geometry of random constraint satisfaction problems
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- A spectral approach to analysing belief propagation for 3-colouring
- The generalized distributive law
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Parallelizing simulated annealing algorithms based on high-performance computer
- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
- Belief propagation for min-cost network flow: convergence and correctness
- A rigorous analysis of the cavity equations for the minimum spanning tree
- Message Passing for Maximum Weight Independent Set
- Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
- Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
- Smoothed analysis of belief propagation for minimum-cost flow and matching
- The Stochastic Properties of Large Battle Models
Cited In (10)
- Convergence and correctness of belief propagation for weighted min-max flow
- A spectral approach to analysing belief propagation for 3-colouring
- Belief propagation for the maximum-weight independent set and minimum spanning tree problems
- Convergence of the belief propagation algorithm for RB model instances
- Convergence analysis of belief propagation algorithm for satisfiability problem
- Hierarchical Chinese postman problem with fuzzy travel times
- Belief propagation for min-cost network flow: convergence and correctness
- Separate but equal: equality in belief propagation for single-cycle graphs
- Belief propagation for unbalanced assignment problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: Convergence and correctness of belief propagation for the Chinese postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010094)
