Treffer: Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.

Title:
Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough: By revisiting key algorithms from computing, a team unlocked hidden efficiency in a long-standing computer science problem.
Authors:
Edwards, Chris
Source:
Communications of the ACM. Sep2023, Vol. 66 Issue 9, p10-12. 3p. 1 Color Photograph.
Subject Terms:
*ALGORITHMS, *COMPUTER programming, *COMPUTER science
People:
BERNSTEIN, Aaron, NANONGKAI, Danupon, WULFF-Nilsen, Christian
Database:
Business Source Premier

Weitere Informationen

The article focuses on how revisiting key algorithms from computing history can unlock the hidden efficiency in computer science problems. The author discusses the shortest-path problem that has been long-standing, explores the use of the Bellman-Ford algorithm, and examines the work of Aaron Bernstein, Danupon Nanongkai, and Christian Wulff-Nilsen.