Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough

被引：0
|
作者：
Edwards, Chris
机构：
[1] Surrey, United Kingdom
来源：
COMMUNICATIONS OF THE ACM | 2023年 / 66卷 / 09期
关键词：
D O I：
10.1145/3607866
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：10 / 12
页数：3
相关论文
共 50 条
  • [21] SHORTEST-PATH AND CLOSURE ALGORITHMS FOR BANDED MATRICES
    ALLISON, L
    DIX, TI
    YEE, CN
    INFORMATION PROCESSING LETTERS, 1991, 40 (06) : 317 - 322
  • [22] APPLICATIONS OF SHORTEST-PATH ALGORITHMS TO MATRIX SCALINGS
    VONGOLITSCHEK, M
    SCHNEIDER, H
    NUMERISCHE MATHEMATIK, 1984, 44 (01) : 111 - 126
  • [23] ASYMPTOTIC OPTIMALITY OF SHORTEST-PATH ROUTING ALGORITHMS
    GAFNI, EM
    BERTSEKAS, DP
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (01) : 83 - 90
  • [24] Shortest-Path Algorithms and Dynamic Cost Changes
    Baselau, Sven
    Hahne, Felix
    Ambrosi, Klaus
    OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 111 - 116
  • [25] DISTRIBUTED COMPUTATION ON GRAPHS - SHORTEST-PATH ALGORITHMS
    CHANDY, KM
    MISRA, J
    COMMUNICATIONS OF THE ACM, 1982, 25 (11) : 833 - 837
  • [26] LEVEL GRAPHS AND APPROXIMATE SHORTEST-PATH ALGORITHMS
    SHAPIRO, J
    WAXMAN, J
    NIR, D
    NETWORKS, 1992, 22 (07) : 691 - 717
  • [27] Speeding up dynamic shortest-path algorithms
    Buriol, Luciana S.
    Resende, Mauricio G. C.
    Thorup, Mikkel
    INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 191 - 204
  • [28] ON THE EQUIVALENCE BETWEEN SOME SHORTEST-PATH ALGORITHMS
    SHERALI, HD
    OPERATIONS RESEARCH LETTERS, 1991, 10 (02) : 61 - 65
  • [29] Faster shortest-path algorithms for planar graphs
    Henzinger, MR
    Klein, P
    Rao, S
    Subramanian, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) : 3 - 23
  • [30] Experimental studies of symbolic shortest-path algorithms
    Sawitzki, D
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 482 - 497
12345