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...
| Publicado en: | Communications of the ACM Vol. 66; no. 9; pp. 10 - 13 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2023
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=170382018&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 170382018 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Sep2023 vid: 66 iid: 9 pid: 68 pub: Association for Computing Machinery artinfo: ui: 170382018 10.1145/3607866 ppf: 10 ppct: 3 formats: tig: atl: 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. aug: au: Edwards, Chris su: Algorithms Computer programming Computer science Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian sug: subj: Algorithms Computer programming Computer science Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2023 holdings: @attributes: islocal: N |
|---|