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]
@inproceedings{RodittyS25,
title = {Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms},
author = {Liam Roditty and Ariel Sapir},
year = {2025},
doi = {10.4230/LIPIcs.FSTTCS.2025.50},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2025.50},
researchr = {https://researchr.org/publication/RodittyS25},
cites = {0},
citedby = {0},
booktitle = {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},
editor = {C. Aiswarya and Ruta Mehta and Subhajit Roy 0001},
volume = {360},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-406-2},
}