Almost shortest paths with near-additive error in weighted graphs

DOI10.4230/LIPICS.SWAT.2022.23MaRDI QIDQ6544080zbMATH OpenFDO

Authors Michael Elkin, Ofer Neiman

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.23

zbMATH Keywords

distance oracleshopsetPRAMshortest pathsspanners

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• On the size overhead of pairwise spanners
• Lightweight near-additive spanners

This page was built for publication: Almost shortest paths with near-additive error in weighted graphs

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