Zachary Friggstad, Ramin Mousavi. A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{FriggstadM23-0, title = {A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs}, author = {Zachary Friggstad and Ramin Mousavi}, year = {2023}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.13}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.13}, researchr = {https://researchr.org/publication/FriggstadM23-0}, cites = {0}, citedby = {0}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA}, editor = {Nicole Megow and Adam Smith}, volume = {275}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-296-9}, }