I wasn't aware that the "NP-heuristics" are able to guaranty such good results like Christofides does.
I only knew because I took a course from a guy (EDIT: Bill Cook, who literally wrote the book on the TSP) whose research specialty was the TSP. Another cool thing about it is that you can find good lower bounds on the length (based on the minimum spanning tree length), so you can use those plus a heuristic (i.e. upper bound) to iteratively find the true solution.
I have no idea whether "good-enough" solutions to the TSP can be translated to "good-enough" solutions to other NP-complete problems, but that's an interesting thought. Many of the ways of reducing one NP-complete problem to another are fairly bizarre, so solution quality might not translate.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|