Convergence and correctness of belief propagation for the Chinese postman problem
From MaRDI portal
Publication:2010094
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
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- A rigorous analysis of the cavity equations for the minimum spanning tree
- A spectral approach to analysing belief propagation for 3-colouring
- Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
- Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Belief propagation for min-cost network flow: convergence and correctness
- Clustering by passing messages between data points
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- Factor graphs and the sum-product algorithm
- Matching, Euler tours and the Chinese postman
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Message Passing for Maximum Weight Independent Set
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- On the solution-space geometry of random constraint satisfaction problems
- Parallelizing simulated annealing algorithms based on high-performance computer
- Smoothed analysis of belief propagation for minimum-cost flow and matching
- The Stochastic Properties of Large Battle Models
- The capacity of low-density parity-check codes under message-passing decoding
- The generalized distributive law
Cited in
(10)- scientific article; zbMATH DE number 7762721 (Why is no real title available?)
- 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
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)
