News for hackers. Stuff that matters.

A comment on Evidence of exponential speed-up in the solution of hard optimization problems?. Parent comment

Re:Evidence of exponential speed-up in the solution of hard ... by NotOscarWilde on Thursday December 28, 2017 @01:29AM (#16020692)
Your solution works only in metric spaces. In non-metric spaces (distances are arbitrary and you are forced to return a cycle, not a tour that repeats vertices) no constant-factor approximation is possible.
[ Parent | on HN ]

There are no comments on this comment yet.