Awesome XKCD today...
I laughed. Hard. My God am I a nerd.
3 Comments
The traveling salesman problem is a famous NP-hard computer science problem. The problem is: Given a number of cities and the costs of travelling from any city to any other city, what is the least-cost round-trip route that visits each city exactly once and then returns to the starting city?
Put simply: it's really difficult to come up with an efficient algorithm (all of that O(n!), etc stuff measures the complexity of solutions). With eBay, you don't have to travel to all of the cities because you can just sell it online. :>
Very funny indeed. Had me laughing very hard. Don't know how I missed this xkcd.
Good to meet you yesterday at Ronald's get together.
Frank
New Comment
Profile
Beth Ballingall
food lover : world traveller : gamer : New Yorker : former Londoner : handbag lover : erstwhile soprano : geek
I actually don't get it; 'splain?