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 条

[1] FASTER ALGORITHMS FOR THE SHORTEST-PATH PROBLEM
AHUJA, RK
MEHLHORN, K
ORLIN, JB
TARJAN, RE
JOURNAL OF THE ACM, 1990, 37 (02) : 213 - 223
[2] GREEDY PARTITIONED ALGORITHMS FOR THE SHORTEST-PATH PROBLEM
ADAMSON, P
TICK, E
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1992, 20 (04) : 271 - 298
[3] Shortest-path reconstruction algorithms
Khoong, C.M., 1600, (36):
[4] SHORTEST-PATH RECONSTRUCTION ALGORITHMS
KHOONG, CM
COMPUTER JOURNAL, 1993, 36 (06): : 588 - 592
[5] SHORTEST-PATH ALGORITHMS - COMPARISON
GOLDEN, B
OPERATIONS RESEARCH, 1976, 24 (06) : 1164 - 1168
[6] ON A MULTICRITERIA SHORTEST-PATH PROBLEM
MARTINS, EQV
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (02) : 236 - 245
[7] FUZZY SHORTEST-PATH PROBLEM
OKADA, S
GEN, M
COMPUTERS & INDUSTRIAL ENGINEERING, 1994, 27 (1-4) : 465 - 468
[8] EFFICIENT SHORTEST-PATH SIMPLEX ALGORITHMS
GOLDFARB, D
HAO, JX
KAI, SR
OPERATIONS RESEARCH, 1990, 38 (04) : 624 - 628
[9] AN EMPIRICAL SURVEY OF SHORTEST-PATH ALGORITHMS
MOFFAT, A
NEW ZEALAND OPERATIONAL RESEARCH, 1983, 11 (02): : 153 - 163
[10] SHORTEST-PATH ALGORITHMS - TAXONOMY AND ANNOTATION
DEO, N
PANG, CY
NETWORKS, 1984, 14 (02) : 275 - 323

← 1 2 3 4 5 →