@InProceedings{friggstad_et_al:LIPIcs.ICALP.2023.63,
author = {Friggstad, Zachary and Mousavi, Ramin},
title = {{An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.63},
URN = {urn:nbn:de:0030-drops-181156},
doi = {10.4230/LIPIcs.ICALP.2023.63},
annote = {Keywords: Directed Steiner tree, Combinatorial optimization, approximation algorithms}
}