Strongly Polynomial Near-Linear-Time Algorithm for Restricted Shortest Paths

Develop a strongly polynomial near-linear-time algorithm for the single-source restricted shortest paths problem on directed graphs, or, more weakly, an algorithm with running time sublinear in the product of the numbers of edges and vertices.

Background

The paper presents a deterministic bicriteria approximation algorithm for the single-source restricted shortest paths problem with running time near-linear in the number of edges, but its complexity depends on numerical parameters such as the length aspect ratio and the approximation parameter. A strongly polynomial algorithm would avoid dependence on the magnitudes or encoding of the edge weights. The authors note that even a sub-mn-time strongly polynomial algorithm would constitute progress, while standard techniques already yield such algorithms for the single-source single-target variant.

References

While it remains open to give a strongly polynomial near-linear time algorithm (in fact, sub-$mn$ time), standard techniques applied to our results give strongly polynomial near-linear time algorithms for the single-source single-target variant (see ).

— A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed Graphs  (2610.18337 - Ashvinkumar, 13 Oct 2026) in Section 1, subsection “Our Results”