Belief propagation for MiniMax Weight Matching
From MaRDI portal
Recommendations
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Belief propagation for minimum weight many-to-one matchings in the random complete graph
- Belief propagation: an asymptotically optimal algorithm for the random assignment problem
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
Cites work
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem
- Belief propagation for min-cost network flow: convergence and correctness
- Minimax grid matching and empirical measures
- Temperature jump and velocity slip in the moment method
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Cited in
(6)- Convex combination belief propagation
- Belief propagation for minimum weight many-to-one matchings in the random complete graph
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- scientific article; zbMATH DE number 6297707 (Why is no real title available?)
- Convergence and correctness of belief propagation for weighted min-max flow
This page was built for publication: Belief propagation for MiniMax Weight Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5356967)