Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed Graphs

Published 13 Oct 2026 in cs.DS | (2610.18337v1)

Abstract: In the restricted shortest paths problem, we are given an nn-vertex mm-edge directed graph GG whose edges are assigned two non-negative weights (or resources) called lengths and costs, a source vertex ss, and a cost threshold CC. The goal is to find, for each target vertex tt, the length of the shortest (s,t)(s,t)-path whose total cost is at most CC. Ashvinkumar, Bernstein, and Karczmarz (SODA 2025) gave the first randomized bicriteria (1+ε,1+ε)(1+\varepsilon,1+\varepsilon)-approximate algorithm on directed graphs running in sub-mnmn time, answering a problem posed by Bernstein (SODA 2012). We substantially improve this on two fronts, supplying a deterministic bicriteria (1+ε,1+ε)(1+\varepsilon,1+\varepsilon)-approximate algorithm running in near-linear time. Our approach straightforwardly generalizes to more than two resources. For kk resources, a deterministic (1+ε1,…,1+εk)(1+\varepsilon_1,\ldots,1+\varepsilon_k)-approximate algorithm running in near-linear time is possible, with ε1=…=εk=ε\varepsilon_1=\ldots=\varepsilon_k=\varepsilon.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.