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