This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
travelling_salesman_problem [2017/03/27 05:59] ntcnet [Computational complexity] |
travelling_salesman_problem [2017/04/05 23:01] sertalpbilal old revision restored (2015/10/28 11:30) |
||
---|---|---|---|
Line 41: | Line 41: | ||
===== Computing a solution ===== | ===== Computing a solution ===== | ||
- | <note tip> | + | ==== Computational complexity ==== |
The problem has been shown to be NP-hard (more precisely, it is complete for the complexity class FPNP; see function problem), and the decision problem version (" | The problem has been shown to be NP-hard (more precisely, it is complete for the complexity class FPNP; see function problem), and the decision problem version (" | ||
=== Complexity of approximation === | === Complexity of approximation === | ||
- | In the general case, finding a shortest travelling salesman tour is NPO-complete. If the distance measure is a metric and symmetric | + | In the general case, finding a shortest travelling salesman tour is NPO-complete. If the distance measure is a metric and symmetric, the problem becomes APX-complete and Christofides’s algorithm approximates it within 1.5. |
If the distances are restricted to 1 and 2 (but still are a metric) the approximation ratio becomes 8/7. In the asymmetric, metric case, only logarithmic performance guarantees are known, the best current algorithm achieves performance ratio $0.814 log(n)$; it is an open question if a constant factor approximation exists. | If the distances are restricted to 1 and 2 (but still are a metric) the approximation ratio becomes 8/7. In the asymmetric, metric case, only logarithmic performance guarantees are known, the best current algorithm achieves performance ratio $0.814 log(n)$; it is an open question if a constant factor approximation exists. |