travelling_salesman_problem
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
travelling_salesman_problem [2024/04/24 03:04] 65.108.99.179 old revision restored (2024/04/21 13:12) |
travelling_salesman_problem [2024/05/19 18:16] (current) 3.16.47.74 old revision restored (2024/04/26 12:15) |
||
|---|---|---|---|
| Line 47: | Line 47: | ||
| 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. | ||
| - | |||
| - | |||
| - | Xiaolong is awesome! | ||
travelling_salesman_problem.1713942277.txt.gz · Last modified: 2024/04/24 03:04 by 65.108.99.179
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
