Directed shortest paths via approximate cost balancing
From MaRDI portal
Publication:6567263
DOI10.1145/3565019MaRDI QIDQ6567263FDOQ6567263
Authors: James B. Orlin, László A. Végh 
Publication date: 4 July 2024
Published in: Journal of the ACM (Search for Journal in Brave)
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
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- Introduction to algorithms.
- Fibonacci heaps and their uses in improved network optimization algorithms
- Depth-First Search and Linear Graph Algorithms
- A Theorem on Boolean Matrices
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Title not available (Why is that?)
- New scaling algorithms for the assignment and minimum mean cycle problems
- A characterization of the minimum cycle mean in a digraph
- A new approach to all-pairs shortest paths on real-weighted graphs
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- Scaling Algorithms for the Shortest Paths Problem
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Approximate binary search algorithms for mean cuts and cycles
- On Pre-Conditioning of Matrices
- Faster all-pairs shortest paths via circuit complexity
- Undirected single-source shortest paths with positive integer weights in linear time
- New Bounds on the Complexity of the Shortest Path Problem
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Title not available (Why is that?)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Faster parametric shortest path and minimum‐balance algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(O(nm)\) time algorithm for finding the min length directed cycle in a graph
- Deterministic APSP, Orthogonal Vectors, and More
- Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
- Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
- Analysis of a Classical Matrix Preconditioning Algorithm
Cited In (1)
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)
