travelling_salesman_problem
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
travelling_salesman_problem [2014/09/23 12:24] sertalpbilal created |
travelling_salesman_problem [2024/04/30 22:36] (current) 3.145.206.169 old revision restored (2014/09/23 19:20) |
||
|---|---|---|---|
| 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.1411489445.txt.gz ยท Last modified: 1998/12/03 12:11 (external edit)
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
