External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Ke Zhang

This author has not been identified. Look up 'Ke Zhang' in Google

Xiaoqing Wang

This author has not been identified. Look up 'Xiaoqing Wang' in Google

Gong Cheng 0001

This author has not been identified. Look up 'Gong Cheng 0001' in Google
runs on