@InProceedings{friggstad_et_al:LIPIcs.SWAT.2016.3,
author = {Friggstad, Zachary and K\"{o}nemann, Jochen and Shadravan, Mohammad},
title = {{A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs}},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
pages = {3:1--3:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-011-8},
ISSN = {1868-8969},
year = {2016},
volume = {53},
editor = {Pagh, Rasmus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.3},
URN = {urn:nbn:de:0030-drops-60323},
doi = {10.4230/LIPIcs.SWAT.2016.3},
annote = {Keywords: Approximation algorithm, Primal-Dual algorithm, Directed Steiner tree}
}