Approximating Shortest Paths in Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670859 (Why is no real title available?)
- scientific article; zbMATH DE number 2038725 (Why is no real title available?)
- scientific article; zbMATH DE number 2079365 (Why is no real title available?)
- scientific article; zbMATH DE number 1875406 (Why is no real title available?)
- scientific article; zbMATH DE number 6469155 (Why is no real title available?)
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- A new approach to all-pairs shortest paths on real-weighted graphs
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- All-Pairs Almost Shortest Paths
- All-pairs small-stretch paths
- Approximate distance oracles
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- Automata, Languages and Programming
- Complexity of network synchronization
- Computing almost shortest paths
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Graph spanners
- Matrix multiplication via arithmetic progressions
- More algorithms for all-pairs shortest paths in weighted graphs
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- On sparse spanners of weighted graphs
- STACS 2005
- Spanners and emulators with sublinear distance errors
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(24)- Approximately counting approximately-shortest paths in directed acyclic graphs
- Approximate shortest paths guided by a small index
- A survey of the all-pairs shortest paths problem and its variants in graphs
- On approximating the longest path in a graph
- A parallel bio-inspired shortest path algorithm
- Solving shortest paths efficiently on nearly acyclic directed graphs
- Bottleneck shortest paths on a partially ordered scale
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Computingk-shortest path lengths in euclidean networks
- Shortest paths in reachability graphs
- On approximating the longest path in a graph
- Approximating a shortest watchman route
- Shortest-path queries in static networks
- Finding next-to-shortest paths in a graph
- Approximate distance oracles with improved preprocessing time
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
- On the equivalence between some shortest path algorithms
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- On the union of intermediate nodes of shortest paths
- Optimally fast shortest path algorithms for some classes of graphs
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
- Extremal Functions for Shortening Sets of Paths
- scientific article; zbMATH DE number 1875406 (Why is no real title available?)
- Approximate Shortest Paths Guided by a Small Index
This page was built for publication: Approximating Shortest Paths in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605483)
