@InProceedings{chalermsook_et_al:LIPIcs.APPROX-RANDOM.2018.8,
author = {Chalermsook, Parinya and Das, Syamantak and Even, Guy and Laekhanukit, Bundit and Vaz, Daniel},
title = {{Survivable Network Design for Group Connectivity in Low-Treewidth Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.8},
URN = {urn:nbn:de:0030-drops-94127},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.8},
annote = {Keywords: Approximation Algorithms, Hardness of Approximation, Survivable Network Design, Group Steiner Tree}
}