Directed shortest paths via approximate cost balancing

Orlin, James B. and Végh, László A. ORCID: 0000-0003-1152-200X (2022) Directed shortest paths via approximate cost balancing. In: Marx, Daniel, (ed.) ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, 235 - 254. ISBN 9781611976465

Text (Directed shortest paths via approximate cost balancing) - Accepted Version Pending embargo until 1 January 2100. Download (525kB)

• Author

Abstract

We present an O(nm) algorithm for all-pairs shortest paths computations in a directed graph with n nodes, m arcs, and nonnegative integer arc costs. This matches the complexity bound attained by Thorup [26] for the all-pairs problems in undirected graphs. Our main insight is that shortest paths problems with approximately balanced directed cost functions can be solved similarly to the undirected case. Our algorithm starts with an O(m√n log n) preprocessing step that finds a 3-min-balanced reduced cost function. Using these reduced costs, every shortest path query can be solved in O(m) time using an adaptation of Thorup's component hierarchy method. The balancing result is of independent interest, and gives the best currently known approximate balancing algorithm for the problem.

Item Type:	Book Section
Official URL:	https://epubs.siam.org/doi/book/10.1137/1.97816119...
Additional Information:	© 2021 by SIAM
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	28 Oct 2022 09:27
Last Modified:	11 Dec 2024 18:07
URI:	http://eprints.lse.ac.uk/id/eprint/117201

Actions (login required)

View Item