Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem.

@inproceedings{zhang-2023-efficient, author = {Ke Zhang and Xiaoqing Wang and Gong Cheng}, editor = {Ying Ding and Jie Tang and Juan F. Sequeda and Lora Aroyo and Carlos Castillo and Geert-Jan Houben}, title = {{Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem}}, booktitle = {{Proceedings of the ACM Web Conference 2023, WWW 2023, Austin, TX, USA, 30 April 2023 - 4 May 2023}}, pages = {199--209}, publisher = {ACM}, year = {2023}, url = {https://doi.org/10.1145/3543507.3583257}, doi = {https://doi.org/10.1145/3543507.3583257} }