Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Zachary Friggstad and Ramin Mousavi. A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{friggstad_et_al:LIPIcs.APPROX/RANDOM.2023.13, author = {Friggstad, Zachary and Mousavi, Ramin}, title = {{A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.13}, URN = {urn:nbn:de:0030-drops-188389}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.13}, annote = {Keywords: Directed Steiner tree, Combinatorial optimization, approximation algorithms} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Zachary Friggstad and Ramin Mousavi. An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 63:1-63:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Zachary Friggstad and Ramin Mousavi. Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 8:1-8:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{friggstad_et_al:LIPIcs.ISAAC.2022.8, author = {Friggstad, Zachary and Mousavi, Ramin}, title = {{Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.8}, URN = {urn:nbn:de:0030-drops-172932}, doi = {10.4230/LIPIcs.ISAAC.2022.8}, annote = {Keywords: Linear programming, approximation algorithms, combinatorial optimization} }
Feedback for Dagstuhl Publishing