Title
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
Abstract
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 r...
Year
DOI
Venue
2015
10.1109/TIT.2015.2466598
IEEE Transactions on Information Theory
Keywords
Field
DocType
Heuristic algorithms,Linear programming,Inference algorithms,Dynamic programming,Optimization,Bipartite graph,Oscillators
Linear programming,Set packing,Criss-cross algorithm,Covering problems,Factor graph,Approximation algorithm,Discrete mathematics,Constraint satisfaction,Combinatorics,Mathematical optimization,Constraint programming,Algorithm,Mathematics
Journal
Volume
Issue
ISSN
61
10
0018-9448
Citations 
PageRank 
References 
2
0.37
15
Authors
2
Name
Order
Citations
PageRank
Guy Even11194136.90
Nissim Halabi283.58