Directed shortest paths via approximate cost balancing
From MaRDI portal
Publication:6567263
Recommendations
- Directed shortest paths via approximate cost balancing
- A new approach to dynamic all pairs shortest paths
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- A new approach to dynamic all pairs shortest paths
- Subcubic cost algorithms for the all pairs shortest path problem
Cites work
- scientific article; zbMATH DE number 1670814 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1979485 (Why is no real title available?)
- scientific article; zbMATH DE number 2079401 (Why is no real title available?)
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- A Theorem on Boolean Matrices
- A characterization of the minimum cycle mean in a digraph
- A new approach to all-pairs shortest paths on real-weighted graphs
- A note on two problems in connexion with graphs
- An \(O(nm)\) time algorithm for finding the min length directed cycle in a graph
- Analysis of a Classical Matrix Preconditioning Algorithm
- Approximate binary search algorithms for mean cuts and cycles
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Depth-First Search and Linear Graph Algorithms
- Deterministic APSP, Orthogonal Vectors, and More
- Faster all-pairs shortest paths via circuit complexity
- Faster parametric shortest path and minimum‐balance algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Introduction to algorithms.
- Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- Network flows. Theory, algorithms, and applications.
- New Bounds on the Complexity of the Shortest Path Problem
- New scaling algorithms for the assignment and minimum mean cycle problems
- On Pre-Conditioning of Matrices
- Scaling Algorithms for the Shortest Paths Problem
- Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Undirected single-source shortest paths with positive integer weights in linear time
This page was built for publication: Directed shortest paths via approximate cost balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567263)
