Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
نویسندگان
چکیده
منابع مشابه
Max Product for Max-Weight Independent Set and Matching
The Max Product (MP) is a local, iterative, message passing style algorithm that has been developed for finding the maximum a posteriori (MAP) assignment of discrete probability distribution specified by a graphical model. The scope of application of MP is vast and in particular it can serve as a heuristic to solve any combinatorial optimization problem. Despite the success of MP algorithm in t...
متن کاملLoopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
Abstract—For the minimum cardinality vertex cover and maximum cardinality matching problems, the max-product form of belief propagation (BP) is known to perform poorly on general graphs. In this paper, we present an iterative annealing BP algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover problem on general graphs. As a consequence, our anneali...
متن کاملThe Maximum-Weight Stable Matching Problem: Duality and Efficiency
Given a preference system (G, ≺) and an integral weight function defined on the edge set of G (not necessarily bipartite), the maximum-weight stable matching problem is to find a stable matching of (G, ≺) with maximum total weight. We study this N P-hard problem using linear programming and polyhedral approaches, and show that the Rothblum system for defining the fractional stable matching poly...
متن کاملTightness of LP via Max-product Belief Propagation
We investigate the question of tightness of linear programming (LP) relaxation for finding a maximum weight independent set (MWIS) in sparse random weighted graphs. We show that an edge-based LP relaxation is asymptotically tight for Erdos-Renyi graph G(n, c/n) for c ≤ 2e and random regular graph G(n, r) for r ≤ 4 when node weights are i.i.d. with exponential distribution of mean 1. We establis...
متن کاملAttributed Tree Matching and Maximum Weight Cliques
A classical way of matching relational structures consists of finding a maximum clique in a derived “association graph.” However, it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e. are trees, since maximum cliques are not constrained to preserve the partial order. We have recently provided a solution to this problem by constructing the ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2007.915695