All pairs almost shortest paths

被引：18

作者：

Dor, D ^{[1
]}

Halperin, S ^{[1
]}

Zwick, U ^{[1
]}

机构：

[1] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL

来源：

37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1996年

关键词：

D O I：

10.1109/SFCS.1996.548504

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：452 / 461

页数：10

共 50 条

[1] All-pairs almost shortest paths
Dor, D
Halperin, S
Zwick, U
SIAM JOURNAL ON COMPUTING, 2000, 29 (05) : 1740 - 1759
[2] Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
Shinn, Tong-Wook
Takaoka, Tadao
LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 226 - 237
[3] All pairs lightest shortest paths
Zwick, Uri
Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 1999, : 61 - 69
[4] An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Akav, Maor
Roditty, Liam
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1 - 11
[5] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
Zwick, U
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
[6] An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Akav, Maor
Roditty, Liam
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1 - 11
[7] Improved algorithm for all pairs shortest paths
Han, YJ
INFORMATION PROCESSING LETTERS, 2004, 91 (05) : 245 - 250
[8] Faster Approximate All Pairs Shortest Paths
Saha, Barna
Ye, Christopher
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4758 - 4827
[9] Algorithms for maintaining all-pairs shortest paths
Misra, S
Oommen, BJ
10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2005, : 116 - 121
[10] New Algorithms for All Pairs Approximate Shortest Paths
Roditty, Liam
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 309 - 320

← 1 2 3 4 5 →