Faster approximation algorithms for restricted shortest paths in directed graphs

DOI10.1137/1.9781611978322.180MaRDI QIDQ7289769zbMATH OpenFDO

Authors Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.180

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Near-optimal directed low-diameter decompositions

This page was built for publication: Faster approximation algorithms for restricted shortest paths in directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289769)