All-Pairs Shortest Paths with a Sublinear Additive Error

DOI10.1007/978-3-540-70575-8_51MaRDI QIDQ3521954zbMATH OpenOpenAlexFDO

Authors Liam Roditty, Asaf Shapira

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• All-pairs shortest paths with a sublinear additive error
• Approximate shortest paths in weighted graphs
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
• All pairs shortest paths for graphs with small integer length edges

Cited in

(6)

• All-pairs shortest paths with a sublinear additive error
• Approximate shortest paths in weighted graphs
• All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
• Algorithms and Computation
• Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths
• A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

This page was built for publication: All-Pairs Shortest Paths with a Sublinear Additive Error

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