<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Joho the Blog &#187; np</title>
	<atom:link href="http://www.hyperorg.com/blogger/tag/np/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.hyperorg.com/blogger</link>
	<description>Let's just see what happens</description>
	<lastBuildDate>Sat, 15 Jun 2013 21:48:22 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Have you heard the one about the bees and the traveling salesman?</title>
		<link>http://www.hyperorg.com/blogger/2010/10/28/have-you-heard-the-one-about-the-bees-and-the-traveling-salesman/</link>
		<comments>http://www.hyperorg.com/blogger/2010/10/28/have-you-heard-the-one-about-the-bees-and-the-traveling-salesman/#comments</comments>
		<pubDate>Thu, 28 Oct 2010 14:42:49 +0000</pubDate>
		<dc:creator>davidw</dc:creator>
				<category><![CDATA[misc]]></category>
		<category><![CDATA[too big to know]]></category>
		<category><![CDATA[bees]]></category>
		<category><![CDATA[np]]></category>

		<guid isPermaLink="false">http://www.hyperorg.com/blogger/?p=9935</guid>
		<description><![CDATA[This is just too cool. The Traveling Salesman Problem is a problem famous for being unintuitively difficult. The question is how you find the most efficient path among multiple geometric points. Sounds easy? With not too many destinations, it becomes outrageously difficult. Except for bees.]]></description>
				<content:encoded><![CDATA[<p>This is just too cool.</p>
<p>The Traveling Salesman Problem is a <a href="http://en.wikipedia.org/wiki/Travelling_salesman_problem">problem</a> famous for being unintuitively <a href="http://en.wikipedia.org/wiki/P_versus_NP_problem">difficult</a>. The question is how you find the most efficient path among multiple geometric points. Sounds easy? With not too many destinations, it becomes outrageously difficult.</p>
<p><a href="http://www.guardian.co.uk/world/2010/oct/24/bees-route-finding-problems?CMP=NECNETTXT1349">Except for bees</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.hyperorg.com/blogger/2010/10/28/have-you-heard-the-one-about-the-bees-and-the-traveling-salesman/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

<!-- Dynamic page generated in 0.283 seconds. -->
<!-- Cached page generated by WP-Super-Cache on 2013-06-16 13:27:16 -->