<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Message-passing for Maximum Weight Independent Set · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0807.5091/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/0807.5091/feed.xml" rel="self" type="application/rss+xml" /><item><title>Message-passing for Maximum Weight Independent Set — mentioned by cicdw</title><link>https://news.ycombinator.com/item?id=35459902</link><guid isPermaLink="false">urn:hackerpapers:mention:0807.5091:35459902</guid><pubDate>Wed, 05 Apr 2023 20:26:10 GMT</pubDate><description>&lt;p&gt;Your algorithm looks surprisingly similar to &amp;quot;Affinity Propagation&amp;quot; which uses message passing techniques to (approximately) optimize the binary integer programming problem. Message passing algorithms have always fascinated me as they seem to be related to deep structure in the original linear programming problem. For example, there are results for other binary problems that show a relationship between fixed points of message passing and optimal dual points to the relaxed linear programming problem (see below for an example with maximum weighted independent sets). Back in the day I spent a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0807.5091/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
