Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms

Liam Roditty, Ariel Sapir. Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms. In C. Aiswarya, Ruta Mehta, Subhajit Roy 0001, editors, 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025, BITS Pilani, K K Birla Goa Campus, India, December 17-19, 2025. Volume 360 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

Abstract

Abstract is missing.