SpeedSteiner: A Fast O(k1/2)-Approximation Algorithm for Directed Steiner Tree.

@inproceedings{zhang-2025-speedsteiner, author = {Guangyi Zhang and Nikolaj Tatti and Aristides Gionis}, editor = {Meeyoung Cha and Carl Yang and Senjuti Basu Roy and Chanyoung Park and Zhenhui Jessie Li and Noseong Park and Carl Yang and Senjuti Basu Roy and Zhenhui Jessie Li and Jaap Kamps and Kijung Shin and Bryan Hooi and Lifang He}, title = {{SpeedSteiner: A Fast O(k1/2)-Approximation Algorithm for Directed Steiner Tree}}, booktitle = {{Proceedings of the 34th ACM International Conference on Information and Knowledge Management, CIKM 2025, Seoul, Republic of Korea, November 10-14, 2025}}, pages = {4096--4105}, publisher = {ACM}, year = {2025}, url = {https://doi.org/10.1145/3746252.3761415}, doi = {https://doi.org/10.1145/3746252.3761415} }