Editing 399: Travelling Salesman Problem
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 12: | Line 12: | ||
A more efficient {{w|Dynamic programming|dynamic programming}} approach, the {{w|Held-Karp algorithm}}, yields a solution in O(n<sup>2</sup>2<sup>n</sup>) time. These times are given using {{w|Big O notation}}, which is commonly used in computer science to show the efficiency or complexity of a solution or algorithm. | A more efficient {{w|Dynamic programming|dynamic programming}} approach, the {{w|Held-Karp algorithm}}, yields a solution in O(n<sup>2</sup>2<sup>n</sup>) time. These times are given using {{w|Big O notation}}, which is commonly used in computer science to show the efficiency or complexity of a solution or algorithm. | ||
β | The joke is that the salesman selling online (say on {{w|eBay}}, {{w|Amazon Marketplace}}, or other virtual marketplace) does not have to worry about this problem | + | The joke is that the salesman selling online (say on {{w|eBay}}, {{w|Amazon Marketplace}}, or other virtual marketplace) does not have to worry about this problem since he does not need to travel (which makes the time to find the best solution O(1)), to which the travelling salesman angrily responds, "Shut the hell up." |
The title text wonders about the time complexity of the {{w|Cutting-plane method|cutting-plane method}}, which is sometimes used to solve optimization problems. | The title text wonders about the time complexity of the {{w|Cutting-plane method|cutting-plane method}}, which is sometimes used to solve optimization problems. | ||
Line 18: | Line 18: | ||
The last sentence suggests the downside for Randall of drawing comics about computer science; he sometimes encounters problems to which he cannot find the answer, whereas authors of simpler comics such as {{w|Garfield}} do not have this problem. This is also likely a reference to [[78: Garfield]], which parodies Garfield's simplicity. | The last sentence suggests the downside for Randall of drawing comics about computer science; he sometimes encounters problems to which he cannot find the answer, whereas authors of simpler comics such as {{w|Garfield}} do not have this problem. This is also likely a reference to [[78: Garfield]], which parodies Garfield's simplicity. | ||
β | The map almost certainly depicts the United States, with the locations highlighted suspected to be (from left to right): Seattle, San Francisco, Los Angeles, Phoenix, Denver, Minneapolis, Dallas, San Antonio, Houston, Chicago (cut off), Detroit, Atlanta, Miami, Washington D.C. | + | The map almost certainly depicts the United States, with the locations highlighted suspected to be (from left to right): Seattle, San Francisco, Los Angeles, Phoenix, Denver, Minneapolis, Dallas, San Antonio, Houston, Chicago (cut off), Detroit, Atlanta, Miami, Washington D.C. Philadelphia, New York and Boston. |
This is so far the only comic featuring the Brown Hat character. | This is so far the only comic featuring the Brown Hat character. |