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

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]

Abstract

Abstract is missing.