<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1208.2543/</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/1208.2543/feed.xml" rel="self" type="application/rss+xml" /><item><title>Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing — mentioned by lorenzhs</title><link>https://news.ycombinator.com/item?id=12642961</link><guid isPermaLink="false">urn:hackerpapers:mention:1208.2543:12642961</guid><pubDate>Wed, 05 Oct 2016 11:26:45 GMT</pubDate><description>&lt;p&gt;Not sure it&amp;#x27;s that easy. But parallel CH preprocessing has been done already, by finding sets of nodes that can be contracted independently (similar to your idea): http://algo2.iti.kit.edu/download/vetter_sa.pdf - the speedup wasn&amp;#x27;t too bad. Also, https://arxiv.org/abs/1208.2543&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1208.2543/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
