Michael Elkin, Yuval Gitlitz, Ofer Neiman. Almost Shortest Paths with Near-Additive Error in Weighted Graphs. In Artur Czumaj, Qin Xin 0001, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands. Volume 227 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{ElkinGN22,
title = {Almost Shortest Paths with Near-Additive Error in Weighted Graphs},
author = {Michael Elkin and Yuval Gitlitz and Ofer Neiman},
year = {2022},
doi = {10.4230/LIPIcs.SWAT.2022.23},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.23},
researchr = {https://researchr.org/publication/ElkinGN22},
cites = {0},
citedby = {0},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands},
editor = {Artur Czumaj and Qin Xin 0001},
volume = {227},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-236-5},
}