News for hackers. Stuff that matters.

A comment on Likelihood of discontinuous progress around the development of AGI. Parent comment

Re:Likelihood of discontinuous progress around the developme... by red75prime on Sunday February 25, 2018 @12:08PM (#16459887)
For traveling salesmen problem there is Christofides algorithm which gives result that is no longer than 3/2 of optimal one. Theoretical bound on inapproximability of symmetrical TSP currently is 185/184.

https://arxiv.org/abs/1303.6437

[ Parent | on HN ]

There are no comments on this comment yet.