TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Computer Scientists Find New Shortcuts for Infamous Traveling Salesman Problem

2 点作者 narad超过 12 年前

1 comment

ColinWright超过 12 年前
This seems word-for-word identical to the submission here:<p><a href="http://news.ycombinator.com/item?id=5142480" rel="nofollow">http://news.ycombinator.com/item?id=5142480</a><p><i>Edit: I've checked - they are effectively identical.</i><p>The comments there point out that this is for a restricted version of the TSP, one in which the edge weightings form a metric (and hence can't be negative). It's unclear to me if that version is NPC.<p>The Wired.com article was also submitted 17 and 18 hours ago, with no discussion. I include the links here purely for completeness:<p><a href="http://news.ycombinator.com/item?id=5140429" rel="nofollow">http://news.ycombinator.com/item?id=5140429</a><p><a href="http://news.ycombinator.com/item?id=5140792" rel="nofollow">http://news.ycombinator.com/item?id=5140792</a>