@InProceedings{neiman_et_al:LIPIcs.ITCS.2024.83,
author = {Neiman, Ofer and Shabat, Idan},
title = {{On the Size Overhead of Pairwise Spanners}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {83:1--83:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.83},
URN = {urn:nbn:de:0030-drops-196110},
doi = {10.4230/LIPIcs.ITCS.2024.83},
annote = {Keywords: Graph Algorithms, Shortest Paths, Spanners}
}