Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
All-Pairs Shortest Paths with a Sublinear Additive Error
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Mixing local and global information for community detection in large networks
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We present an approximation algorithm for the all pairs shortest paths (APSP) problem in weighed graphs. Our algorithm solves the APSP problem for weighted directed graphs, with real (positive or negative) weights, up to an additive error of @e. For any pair of vertices u,v, the algorithm finds a path whose length is at most @d(u,v)+@e. The algorithm is randomized and runs in O@?(n^(^@w^+^3^)^/^2)