Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough

IF 11.1 3区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Communications of the ACM Pub Date : 2023-08-23 DOI:10.1145/3607866

C. Edwards

引用次数: 0

Abstract

By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.

查看原文本刊更多论文

历史算法帮助解锁最短路径问题突破

通过重新审视计算中的关键算法，一个团队解开了一个长期存在的计算机科学问题中隐藏的效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Communications of the ACM 工程技术-计算机：理论方法

CiteScore

16.10

自引率

0.40%

发文量

276

审稿时长

6-12 weeks

期刊介绍： Communications of the ACM is the leading print and online publication for the computing and information technology fields. Read by computing''s leading professionals worldwide, Communications is recognized as the most trusted and knowledgeable source of industry information for today’s computing professional. Following the traditions of the Communications print magazine, which each month brings its readership of over 100,000 ACM members in-depth coverage of emerging areas of computer science, new trends in information technology, and practical applications, the Communications website brings topical and informative news and material to computing professionals each business day. ACM''s membership includes the IT industry''s most respected leaders and decision makers. Industry leaders have for more than 50 years used the monthly Communications of the ACM magazine as a platform to present and debate various technology implications, public policies, engineering challenges, and market trends. The Communications website continues that practice.