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.

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 Bernst...

Full description

Bibliographic Details

Published in:	Communications of the ACM Vol. 66; no. 9; pp. 10 - 13
Main Author:	Edwards, Chris
Format:	Article
Published:	Association for Computing Machinery Sep2023
Subjects:	Algorithms Computer programming Computer science Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian
Online Access:	View this record in EBSCOhost