Sunday, March 23, 2008

Travelling Salesman Problem @ XKCD

I couldn't stop laughing when I saw the most recent comic over on XKCD:

As always I also love the title that Randall Monroe uses for the images. In this case it was: "What's the complexity class of the best linear programming cutting-plane techniques? I couldn't find it anywhere. Man, the Garfield guy doesn't have these problems ..."

Outstanding stuff indeed!

No comments: