Directed shortest paths via approximate cost balancing

DOI10.5555/3458064.3458080arXiv2007.07975MaRDI QIDQ6147263FDOQ6147263

Authors: James B. Orlin, László A. Végh 

Publication date: 15 January 2024

Full work available at URL: https://arxiv.org/abs/2007.07975

Recommendations

• Directed shortest paths via approximate cost balancing
• A new approach to dynamic all pairs shortest paths
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• scientific article; zbMATH DE number 1670814
• A new approach to dynamic all pairs shortest paths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (1)

• Directed shortest paths via approximate cost balancing

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 Q6147263)