@InProceedings{makarychev_et_al:LIPIcs.ICALP.2024.111,
author = {Makarychev, Yury and Ovsiankin, Max and Tani, Erasmo},
title = {{Approximation Algorithms for 𝓁\underlinep-Shortest Path and 𝓁\underlinep-Group Steiner Tree}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {111:1--111:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.111},
URN = {urn:nbn:de:0030-drops-202542},
doi = {10.4230/LIPIcs.ICALP.2024.111},
annote = {Keywords: Shortest Path, Asymmetric Group Steiner Tree, Sum-of-Squares}
}