Approximate shortest paths in weighted graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1875406 (Why is no real title available?)
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- All-Pairs Almost Shortest Paths
- All-Pairs Shortest Paths with a Sublinear Additive Error
- An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Faster scaling algorithms for general graph matching problems
- Matrix multiplication via arithmetic progressions
- More algorithms for all-pairs shortest paths in weighted graphs
- On the exponent of all pairs shortest path problem
- Scaling Algorithms for the Shortest Paths Problem
Cited in
(26)- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
- All-Pairs Almost Shortest Paths
- Algorithms and Data Structures
- Bundling all shortest paths
- On the k Shortest Simple Paths Problem in Weighted Directed Graphs
- Mixing local and global information for community detection in large networks
- Approximating Shortest Paths in Graphs
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- A parallel bio-inspired shortest path algorithm
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Counting approximately-shortest paths in directed acyclic graphs
- Shortest Paths with Bundles and Non-additive Weights Is Hard
- On paths with the shortest average arc length in weighted graphs
- scientific article; zbMATH DE number 7204496 (Why is no real title available?)
- The summation and bottleneck minimization for single-step searching on weighted graphs
- Shortest paths with ordinal weights
- Lightweight paths in graphs
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Successive shortest paths in complete graphs with random edge weights
- scientific article; zbMATH DE number 7236428 (Why is no real title available?)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Shortest paths in networks with vector weights
- Approximately counting approximately-shortest paths in directed acyclic graphs
- Maintaining shortest paths under deletions in weighted directed graphs
- All-Pairs Shortest Paths with a Sublinear Additive Error
This page was built for publication: Approximate shortest paths in weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414929)
