Message Passing for Maximum Weight Independent Set
In this paper, we investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed-point estimate of max product can be mapped...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62216 https://orcid.org/0000-0003-0737-3259 https://orcid.org/0000-0003-0149-5888 |