Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming

• Published in: IEEE transactions on information theory Vol. 61; no. 10; pp. 5295 - 5305
• Main Authors: Even, Guy, Halabi, Nissim
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2015; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; belief propagation (BP); Bipartite graph; combinatorial optimization; covering problems; Dynamic programming; Errors; factor graphs; graph cover; Heuristic algorithms; Inference algorithms; Linear programming; linear programming (LP); Matrix; max-product algorithm; message-passing algorithms; min-sum algorithm; Optimization; Oscillators; packing problems; Variables; Vector space; max-product algorithm; combinatorial optimization; graph cover; Belief propagation (BP); min-sum algorithm; dynamic programming; factor graphs; covering problems; linear programming (LP); message-passing algorithms; packing problems
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2015.2466598

Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications, including decoding error correcting codes and solving constraint satisfaction and inference problems. The BP-based algorithms operate over graph representations, called factor graphs, that are used to model the input. Although in many cases, the BP-based algorithms exhibit impressive empirical results, not much has been proved when the factor graphs have cycles. This paper deals with packing and covering integer programs in which the constraint matrix is zero-one, the constraint vector is integral, and the variables are subject to box constraints. We study the performance of the min-sum algorithm when applied to the corresponding factor graph models of packing and covering linear programmings (LPs). We compare the solutions computed by the min-sum algorithm for packing and covering problems to the optimal solutions of the corresponding LP relaxations. In particular, we prove that if the LP has an optimal fractional solution, then for each fractional component, the minsum algorithm either computes multiple solutions or the solution oscillates below and above the fraction. This implies that the min-sum algorithm computes the optimal integral solution only if the LP has a unique optimal solution that is integral. The converse is not true in general. For a special case of packing and covering problems, we prove that if the LP has a unique optimal solution that is integral and on the boundary of the box constraints, then the min-sum algorithm computes the optimal solution in pseudopolynomial time. Our results unify and extend recent results for the maximum weight matching problem and for the maximum weight independent set problem.