Tightness of LP via Max-product Belief Propagation

Details Tightness of LP via Max-product Belief Propagation Tightness of LP via Max-product Belief Propagation

2005-08-23

arxiv.org/abs/cs/0508097v2

Computer Science

Data Structures and Algorithms

Scientific paper

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 \leq 2e$ and random regular graph $G(n,r)$ for $r\leq 4$ when node weights are i.i.d. with exponential distribution of mean 1. We establish these results, through a precise relation between the tightness of LP relaxation and convergence of the max-product belief propagation algorithm. We believe that this novel method of understanding structural properties of combinatorial problems through properties of iterative procedure such as the max-product should be of interest in its own right.

Affiliated with

Also associated with

No associations

Rating

Tightness of LP via Max-product Belief Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tightness of LP via Max-product Belief Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tightness of LP via Max-product Belief Propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165804