A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.

DOI10.4230/LIPICS.ESA.2021.4OpenAlexW3196638783MaRDI QIDQ6052038

Maor Akav, Liam Roditty

Publication date: 20 September 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2021.4

zbMATH Keywords

graph algorithmsdistance oraclesapproximate all pairs of shortest paths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.