TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Amoeba-Based Computer Solves Traveling Salesman Puzzle

4 pointsby eaguyhnover 6 years ago

1 comment

gus_massaover 6 years ago
Similar posts have been discussed in the past. For example <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=18735903" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=18735903</a><p>Note that the amoeba system finds only an approximated solution, it is not guarantee to found the best solution. Also, it finds it in linear time (for some definition of linear). And the graphs are small (8 cities).<p>So ... this is at best a new nice heuristic. There are plenty of heuristics, it&#x27;s not clear that is better than the other heuristics.<p>The difficult part is guarantee to find the best solution fo large graphs in non exponential time.