399: Travelling Salesman Problem
|Travelling Salesman Problem|
Title text: 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...
The Travelling salesman problem is a classic problem in computer science. An intuitive way of stating this problem is that given a list of cities and their pairwise distances, the task is to find the shortest possible route that visits each city exactly once and then returns to the origin city. A naive solution solves the problem in O(n!) time (where n is the size of the list), simply by checking all possible routes, and selecting the shortest one. A more efficient dynamic programming approach yields a solution in O(n22n) time.
The joke is that the salesman selling online (say on eBay, Amazon Marketplace, or other virtual marketplace) does not have to worry about this problem since he does not need to travel, to which the travelling salesman angrily responds "shut the hell up".
The title text wonders about the time complexity of the Cutting-plane method, which is sometimes used to solve optimization problems. The last sentence suggests the down side for Randall of writing comics about computer science; he sometimes encounters problems to which he cannot find the answer, whereas authors of simpler comics such as Garfield do not have this problem. This is also likely a reference to 78: Garfield, which parodies Garfield's simplicity.
This is so far the only comic featuring the Brown Hat character.
Also see previous strip 287: NP-Complete.
- [There is a linked black web, with a path in red; it may be a map of the USA.]
- Brute-force solution:O(n!)
- [The web continues in this one. A man with a hat and a case is drawing it.]
- Dynamic programming algorithms: O(n22n)
- [Another man, with a hat too, is at a computer, looking back over the chair.]
- Selling on eBay: O(1)
- eBay salesman: Still working on your route?
- Drawing salesman: Shut the hell up.