An almost 2-approximation for all-pairs of shortest paths in subquadratic time

DOI10.1137/1.9781611975994.1OpenAlexW2998699635MaRDI QIDQ5146761

Liam Roditty, Maor Akav

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

New algorithms for all pairs approximate shortest paths ⋮ Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics

This page was built for publication: An almost 2-approximation for all-pairs of shortest paths in subquadratic time