<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2206.13211/</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/2206.13211/feed.xml" rel="self" type="application/rss+xml" /><item><title>Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set — HN submission</title><link>https://news.ycombinator.com/item?id=32303539</link><guid isPermaLink="false">urn:hackerpapers:submission:2206.13211:32303539</guid><pubDate>Mon, 01 Aug 2022 08:53:47 GMT</pubDate><description>&lt;p&gt;When modern graph neural networks do worse than classical greedy algorithms&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2206.13211/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
