A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

被引：0

作者：

Zwick, Uri ^{[1
]}

机构：

[1] School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004年 / 3341卷

关键词：

D O I：

10.1007/978-3-540-30551-4_78

中图分类号：

O144 [集合论]; O157 [组合数学（组合学）];

学科分类号：

070104 ;

摘要：

We present an O(n3√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz. © Springer-Verlag 2004.

引用

页码：921 / 932

共 50 条

[1] A slightly improved sub-cubic algorithm for the All Pairs Shortest Paths problem with real edge lengths
Zwick, U
ALGORITHMS AND COMPUTATION, 2004, 3341 : 921 - 932
[2] A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
Uri Zwick
Algorithmica, 2006, 46 : 181 - 192
[3] A slightly improved sub-cubic algorithm for the All Pairs Shortest Paths problem with real edge lengths
Zwick, Uri
ALGORITHMICA, 2006, 46 (02) : 181 - 192
[4] Sub-cubic cost algorithms for the all pairs shortest path problem
Takaoka, T
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 333 - 343
[5] Improved algorithm for all pairs shortest paths
Han, YJ
INFORMATION PROCESSING LETTERS, 2004, 91 (05) : 245 - 250
[6] All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time
Vassilevska, Virginia
Williams, Ryan
Yuster, Raphael
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 585 - 589
[7] Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, Camil
Italiano, Giuseppe F.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (05) : 813 - 837
[8] Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, C
Italiano, GF
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 260 - 267
[9] Fuzzy all-pairs shortest paths problem
Seda, Milos
COMPUTATIONAL INTELLIGENCE, THEORY AND APPLICATION, 2006, : 395 - 404
[10] AN ALGEBRAIC DECOMPOSED ALGORITHM FOR ALL PAIRS SHORTEST PATHS
Wang, I-Lin
PACIFIC JOURNAL OF OPTIMIZATION, 2014, 10 (03): : 561 - 576

← 1 2 3 4 5 →