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/08/31 15:26] 47.128.117.101 old revision restored (2024/08/23 21:21) |
travelling_salesman_problem [2024/09/26 05:52] (current) 124.243.148.22 old revision restored (2024/09/12 18:03) |
||
|---|---|---|---|
| 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.1725132408.txt.gz · Last modified: 2024/08/31 15:26 by 47.128.117.101
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
